#include <iostream>
#include <fstream>
using namespace std;

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

int n, k, sets[19], fr[19];

void combinari(int  lg, int last) {
    if (lg == k + 1) {
        for (int i = 1; i <= k; ++i) {
            fout << sets[i] << ' ';
        }
        fout << '\n';
        return;
    }
    for (int i = last; i <= n; ++i) {
        if (i > sets[lg - 1]) {
            sets[lg] = i;
            combinari(lg + 1, i);
        }
    }
}

int main() {
    fin >> n >> k;
    combinari(1, 1);
    return 0;
}