#include <bits/stdc++.h>

using namespace std;

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

const int MAXN = 18;

int n, k;
int s[MAXN + 1];

void bck(int p) {
    if (p == k + 1) {
        for (int i = 1; i <= k; ++ i)
            out << s[i] << ' ';
        out << '\n';
    }
    else {
        for (int i = s[p - 1] + 1; i <= n; ++ i) {
            s[p] = i;
            bck(p + 1);
        }
    }
}

int main() {
    in >> n >> k;
    bck(1);

    return 0;
}