#include <bits/stdc++.h>

using namespace std;

int solutie[20];
int visited[20];

void bkt(int pos, int k, int n, int lastValue) {
    if (pos > k) { // solutia reprezinta o permutare, si o afisez direct
        for (int i = 1; i <= k; i++) {
            cout << solutie[i] << " ";
        }
        cout << '\n';
        return;
    }
    for (int val = lastValue + 1; val <= n; ++val) { // anumite val pot fi deja puse in solutie
        if (visited[val]) continue;

        solutie[pos] = val;
        visited[val] = 1;
        bkt(pos + 1, k, n, val);
        // cand ma intorc din recursivitate, valoarea selectata la pozitia pos se va modifica
        visited[val] = 0; // de vizitam valoarea
    }
}

int main()
{
    freopen("combinari.in", "r", stdin);
    freopen("combinari.out", "w", stdout);
    int n, k;
    cin >> n >> k;
    bkt(1, k, n, 0);
    return 0;
}