#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>

using namespace std;

int sol[20];
int used[20];
int n, k;
ifstream fin("combinari.in");
ofstream fout("combinari.out");

void back(int pos) {
    if (pos == k + 1) {
        for (int i=1; i<=k; i++)
            fout << sol[i] << ' ';
        fout << '\n';
        return;
    }
    for (int i=1; i<=n; i++) {
        if (!used[i] && (pos == 1 || i>=sol[pos-1])) {
            used[i] = 1;
            sol[pos] = i;
            back(pos + 1);
            sol[pos] = 0;
            used[i] = 0;
        }
    }
}

int main(void) {
    fin >> n >> k;
    back(1);
    fin.close();
    fout.close();
    return 0;
}