#include <cstdio>
int x[20],n,k;
bool fail=false;

void next_comb(int p){
    if(p==0){fail=true; return ;} else
    if(x[p]+1>n-(k-p)){
        next_comb(p-1);
        x[p]=x[p-1]+1; } else x[p]++;
}

int main(){
    int i=0;
    freopen("combinari.in","r",stdin);
    freopen("combinari.out","w",stdout);
        scanf("%d %d",&n,&k);
    for(int i=1;i<=k;i++)x[i]=i;
    while(!fail){
        for(int i=1;i<=k;i++)printf("%d ",x[i]);
        printf("\n");
        next_comb(k); }
}