#include <iostream>
#include <fstream>
using namespace std;
ifstream in("combinari.in");
ofstream out("combinari.out");
bool pus[10]; /// pus[i] = 1 daca i a fost pus sau nu
int v[10]; /// solutia mea
int n, k;

void backtracking(int poz)
{
    if(poz == k + 1) /// trebuie sa afisez solutia
    {
        for(int i = 1; i <= k; i++)
            out << v[i] << " ";
        out << "\n";
        return;
    }
    for(int i = v[poz - 1] + 1; i <= n; i++)
    {
        if(pus[i] == 1)
            continue;
        v[poz] = i;
        pus[i] = 1;
        backtracking(poz + 1);
        v[poz] = 0;
        pus[i] = 0;
    }
}

int main()
{
    in >> n >> k;
    backtracking(1);
    return 0;
}