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

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

int k, n, v[103], viz[103];

void solve(int lvl)
{
    if (lvl == k + 1)
    {
        for (int i = 1; i <= k; ++i)
            g << v[i] << ' ';
        g << '\n';
        return;
    }

    for (int i = v[lvl - 1] + 1; i <= n; ++i)
    {
        if (viz[i])
            continue;

        viz[i] = 1;
        v[lvl] = i;
        solve(lvl + 1);
        viz[i] = 0;
    }
}

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