#include <bits/stdc++.h>

using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
const int nMax = 20;
int St[nMax], n, k;
inline void Back(int top) {
    if(top == k + 1) {
        for(int i = 1; i <= k; i++) {
            g << St[i] << " ";
        }
        g << "\n";
    }
    else {
        for(int i = St[top - 1] + 1; i <= n; i++) {
            St[top] = i;
            Back(top + 1);
        }
    }
}
int main()
{
    f >> n >> k;
    Back(1);
    return 0;
}