#include <bits/stdc++.h>
using namespace std;
ifstream fin ("combinari.in");
ofstream fout ("combinari.out");
const short Nmax = 20;
int n , k , st[Nmax];
void Back(int top)
{
    if(top == k + 1)
    {
        for(int i = 1 ; i <= k ; i++)
            fout << st[i] << " ";
        fout << "\n";
    }
    else for(int i = 1 + st[top - 1] ; i <= n ; i++)
    {
        st[top] = i;
        Back(top + 1);
    }
}
int main()
{
    fin >> n >> k;
    Back(1);
    fin.close();
    fout.close();
    return 0;
}