#include <iostream>
#include <vector>
#include <map>
#include <cstring>
#include <fstream>
#include <sstream>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>
#include <set>
#include <unordered_map>
#include <stack>
#include <iomanip>
#include <random>
#include <climits>

using namespace std;

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

int n, k;

void backtracking(int lastIndex, vector<int> sets) {
    if ((int) sets.size() == k) {
        for (auto item: sets) {
            fout << item << " ";
        }
        fout << "\n";
    }

    for (int i = lastIndex; i <= n; ++i) {
        sets.push_back(i);
        backtracking(i + 1, sets);
        sets.pop_back();
    }
}

int main() {
    fin >> n >> k;

    vector<int> sets;
    backtracking(1, sets);
    return 0;
}