#include <fstream>
using namespace std;
ifstream in ("combinari.in");
ofstream out ("combinari.out");
int n, k, x[19];

void afis()
{
    for (int i = 1; i <= k; i++)
        out << x[i] << " ";
    out << '\n';
}

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

int main()
{
    in >> n >> k; back(1);
    out.close(); return 0;
}