#include <cstdio>
#include <algorithm>
using namespace std;
int nr,i,x,j,n,k,v[20];
int main()
{
    freopen("combinari.in","r",stdin);
    freopen("combinari.out","w",stdout);
    scanf("%d%d",&n,&k);
    for (i=1;i<=(1<<n)-1;i++)
    {
        x=i;nr=0;
        for (j=1;j<=n;j++)
        {
            if (x%2==1) {nr++;v[nr]=j;}
            x=x/2;
        }
        if (nr==k)
        {
            sort(v+1,v+nr+1);
            for (j=1;j<=nr;j++) printf("%d ",v[j]);        printf("\n");

        }
    }
    return 0;
}