#include <stdio.h>
#include <stdlib.h>
int v[20],f[20];
void bkt(int n,int p,int k)
{
    int i=1;
    if(p>k){
        for(i=1; i<=k; i++)
            printf("%d ",v[i]);
        printf("\n");
    }
    else
        for(v[p]=v[p-1]+1; v[p]<=n; v[p]++)
            if(f[v[p]]==0)
            {
                f[v[p]]=1;
                bkt(n,p+1,k);
                f[v[p]]=0;
            }
}
int main()
{
    int n,k;
    freopen("combinari.in","r",stdin);
    freopen("combinari.out","w",stdout);
    scanf("%d%d",&n,&k);
    f[n+1]=1;
    bkt(n,1,k);

    return 0;
}