//Sa se genereze toate combinarile de N luate cate K in ordine lexicografica
#include<iostream>
#include<fstream>
using namespace std;
int n,k,x[20];
ofstream fout("combinari.out");
FILE * pFile;

void back(int j)
{
    int i;
    for(i=x[j-1]+1;i<=n;i++)
    {
        x[j]=i;
        if(j==k)
        {
            for(int i=1;i<=k;i++)
                fprintf(pFile, "%1d ",x[i]);
            fprintf(pFile,"\n");
        }
        else
            back(j+1);
    }
}

int main()
{
    ifstream fin("combinari.in");
    fin>>n>>k;
    fin.close();
    pFile = fopen ("combinari.out","w");
    back(1);
    return 0;
}