#include <fstream>
#include <cstring>
#include <algorithm>
using namespace std;

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

const int MAXN = 25;
int n, m;
int v[MAXN];

void back(int k) {

    if (k > m) {
        for (int i = 1; i <= m; ++i) {
            fout << v[i] << ' ';
        }
        fout << '\n';
    }
    else {
        for (int i = v[k - 1] + 1; i <= n; ++i) {
            v[k] = i;
            back(k + 1);
        }
    }
}

int main() {

    fin >> n >> m;

    back(1);

    fout.close();
    return 0;
}