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

using namespace std;

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

int n,k;

int main()
{
    int n, k;
    f >> n;
    f >> k;

    vector<bool> v(n);
    fill(v.begin(), v.end() - n + k, true);

    do{
        for (int i = 0; i < n; ++i) {
            if (v[i]) {
                g << (i+1) << " ";
            }
        }
        g << "\n";
    }while (prev_permutation(v.begin(), v.end()));

    return 0;
}