#include <fstream>
#include<cmath>
#include<algorithm>
using namespace std;

ifstream cin("combinari.in");
ofstream cout("combinari.out");

int n,k;
int f[16];
int p[16];

void bkt(int q){
    if(q==k+1){
         for(int i=1;i<=k;i++)cout<<p[i]<<" ";
         cout<<endl;
         return;
    }

    for(int val=p[q-1]+1;val<=n;val++){
         p[q]=val;
         bkt(q+1);
    }
}


int main()
{
    cin>>n>>k;
    bkt(1);
}