#include <cstdio>

using namespace std;

FILE *f=fopen("combinari.in","r");
FILE *g=fopen("combinari.out","w");

int n, m, v[19];

void print()
{
    for (int i = 1; i <= m; i++)
        fprintf(g,"%d ",v[i]);
    fprintf(g,"\n");
}

void back(int k)
{
    for (v[k] = v[k-1]+1; v[k] <= n-m+k; v[k]++)//obs: v[0]==0 ceea ce ne aranjeaza
        if (k == m)
            print();
        else
            back(k + 1);
}

int main()
{
    fscanf(f,"%d%d",&n,&m);
    back(1);
    fclose(f);
    fclose(g);
    return 0;;
}