#include <cstdio>
#include <algorithm>
using namespace std;

int n,k,x[20];

void comb(int p){
    if(x[p]<n-k+p)x[p]++; else
    {
        comb(p-1);
        x[p]=x[p-1]+1;
    }
}


int main(){
    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;

        do{
            for(int i=1;i<=k;i++)printf("%d ",x[i]);
            printf("\n");
            comb(k);
        }while(x[0]==0);

    return 0;
}