#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;

int n, k;
bool marked[20];
vector<int> a;

///generate all possible allocations that start from a
void solve() {
    if (a.size() == k) {
        for (int i = 0; i < a.size(); i++)
            cout << a[i] << ' ';
        cout << "\n";
        return;
    }

    ///try to add one more element
    for (int e = 1; e <= n; e++) {
        ///try adding to a
        if (!marked[e] && (a.size() == 0 || a[a.size() - 1] <= e + 1)) {
            a.push_back(e);
            ///a[0], a[1], a[2] ... , a[a.size() - 1], e
            marked[e] = 1;
            solve();
            marked[e] = 0;
            a.pop_back();
        }
    }
}

int main()
{
    cin >> n >> k;
    solve();
    return 0;
}