#include <bits/stdc++.h>

using namespace std;
int n,k,sol[20];
bool fr[20]={0};
static void afis(int k){
for(int i=1;i<=k;++i)
    printf("%d ",sol[i]);
printf("\n");
}
static void back_tr(int kcurr=1){
for(int i=sol[kcurr-1]+1;i<=n;++i)
    if(!fr[i]){
    fr[i]=1;
    sol[kcurr]=i;
    if(kcurr==k)
        afis(k);
    else back_tr(kcurr+1);
    fr[i]=0;
    }
}
int main()
{
    freopen("combinari.in","r",stdin);
    freopen("combinari.out","w",stdout);
    scanf("%d %d",&n,&k);
    back_tr();
}