#include <bits/stdc++.h>
using namespace std;

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

int N, st[20], used[20], K;

void print() {
    for (int i = 1; i <= K; ++i) {
        g << st[i] << ' ';
    }
    g << '\n';
}

void bkt(int top) {
    if (top > K) {
        print();
        return;
    }

    for (int i = st[top - 1] + 1; i <= N; ++i) {
        if (!used[i]) {
            used[i] = 1;
            st[top] = i;
            bkt(top + 1);
            used[i] = 0;
        }
    }
}

int main() {
    f >> N >> K;
    bkt(1);
    return 0;
}