#include <bits/stdc++.h>

using namespace std;

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

const int NMAX = 20;
int n, k;
int st[NMAX];

void write() {
    for (int i = 1; i <= k; ++i) {
        g << st[i] << ' ';
    }
    g << '\n';
}

void backtr (int p) {
    if (p == k + 1) {
        write();
        return;
    }
    for (int i = st[p - 1] + 1; i <= n; ++i) {
        st[p] = i;
        backtr(p + 1);
    }
}

int main() {
    f >> n >> k;
    backtr(1);
    f.close();
    g.close();
    return 0;
}