#include <iostream>
#include <fstream>
#include <algorithm>
#include <cmath>

#include <string>
#include <vector>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <deque>
#include <queue>
#include <stack>

using namespace std;

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

typedef long long ll;

int n, m;
vector<int> v;

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

void Solve() {
    fin >> n >> m;
    v.resize(m + 1);
    bkt(1);
}

int main() {

    ios_base::sync_with_stdio(false);

    Solve();

    return 0;
}