#include <cstdio>

using namespace std;

int n,m,x[100100];

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

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

int backtracking(int k)
{
    for(x[k]=x[k-1]+1;x[k]<=n-m+k;x[k]++)
        if(k==m)
            display_sol();
        else backtracking(k+1);
}

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