#include <bits/stdc++.h>

using namespace std;

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

vector<int> path;
int n, k;

void backtrack(int start) {
    if (path.size() == k) {
        for (int i = 0; i < k; i++)
            g << path[i] << ' ';
        g << '\n';
        return;
    }

    for (int i = start; i <= n; i++) {
            path.push_back(i);
            backtrack(i + 1);

            path.pop_back();
    }
}

int main() {
    f >> n >> k;
    backtrack(1);
}