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

int n, k, a[19];

ofstream fout("combinari.out");

void back(int lvl)
{
    if (lvl == k + 1)
    {
        for (int i = 1; i <= k; i++)
            fout << a[i] << ' ';
        fout << '\n';
        return;
    }
    for (int i = a[lvl - 1] + 1; i <= n; i++)
    {
        a[lvl] = i;
        back(lvl + 1);
    }
}

int main()
{
    ifstream cin("combinari.in");
    cin >> n >> k;
    a[0] = 0;
    back(1);
}