#include <cstdio>
int x[10],n,k,i,j=1;
int main(){
    freopen("combinari.in","r",stdin);
    freopen("combinari.out","w",stdout);
    scanf("%d %d",&n,&k);
    for (i=1;i<=k;i++) x[i]=i;
    while (j>0) {for (i=1;i<=k;i++) printf("%d ",x[i]);
                 printf("\n");
                 j=k;
                 while (x[j]==n-k+j) j--;
                 if (j>0) {x[j]++;
                           for (i=j+1;i<=k;i++) x[i]=x[i-1]+1;}
                 }
      fclose(stdout);
    return 0;
}