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

int c[20],n,k;

void next_comb(int p){
    if( c[p] + 1 <= p + (n-k) )
    {
        c[p]++;
        return ;
    } else next_comb(p-1);
        c[p] = c[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++)c[i] = i;

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

    return 0;
}