#include <cstdio>
using namespace std;
bool uz[20];
int sol[20],n,k;
void back(int p);
int main()
{
    freopen("combinari.in","r",stdin);
    freopen("combinari.out","w",stdout);
    scanf("%d%d",&n,&k);
    back(1);
    return 0;
}
void back(int p){
    if(p==k+1){
        for(int i=1;i<=k;i++)
            printf("%d ",sol[i]);
        printf("\n");
    }
    else{
        for(int i=sol[p-1]+1;i<=n;i++)
            if(uz[i]==0){
                sol[p]=i;
                uz[p]=1;
                back(p+1);
                uz[p]=0;
            }
    }
}