/// combinari
#include <iostream>
#include <fstream>
#include <utility>
#include <algorithm>
#define NMax 19
///#define f cin
///#define g cout
using namespace std;

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

int st[NMax], n, p, fol[NMax];

bool valid(int k)
{
    for(int i = 1; i < k; ++i)
        if(st[k] == st[i]) return false;
    return true;
}

void afisare()
{
    for(int i = 1; i <= p; ++i)
        g << st[i] << " ";
    g << '\n';
}

void back(int k)
{
    for(int i = st[k - 1] + 1; i <= n; ++i)
    {
        st[k] = i;
        if(valid(k))
            if(k == p) afisare();
            else back(k + 1);
    }
}

int main()
{
    f >> n >> p;
    back(1);
    return 0;
}