#include <fstream>
#include <vector>
#include <cmath>

using namespace std;

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

const int MAXN = 100001;
int sol[20] ;
int n,k;

void build(int lastTermen, int length) {
    /// base condition
    if (length == k) {
        for (int i = 0; i < k; ++i) {
            cout << sol[i] << ' ';
        }
        cout << '\n';
        return;
    }
    if (lastTermen == n + 1)
        return;

    /// recursive function
    for (int i = lastTermen + 1; i <= n; ++i) {
        sol[length] = i;
        build(i, length + 1);
    }
}
void solve() {
    cin >> n >> k;
    build(0, 0);
}
int main() {
    cin.tie(NULL);
    std::ios_base::sync_with_stdio(false);
    solve();
}