#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
FILE*fin=fopen("combinari.in","r");
FILE*fout=fopen("combinari.out","w");
int i,j,k,m,l,n,w[100];
vector <int> v;
int main()
{
    fscanf(fin,"%d%d",&n,&k);
    for(i=1;i<=n-k;i++)
    v.push_back(0);
    for(i=1;i<=k;i++)
    v.push_back(1);
    for(i=0;i<=n;i++)
    w[i]=i+1;
    do
    {
        for (i=0;i<n;i++)
        if (v[i]==1)
        fprintf(fout,"%d ",w[i]);
        fprintf(fout,"\n");
    }while (next_permutation(v.begin(),v.end()));

    return 0;
}