#include <iostream>
#include <fstream>
#include <vector>

using namespace std;

ifstream fin ("combinari.in");
ofstream fout ("combinari.out");

int n, k;
vector<int> v;
void back()
{
    if (v.size() == k)
    {
        for (int j = 0; j < v.size(); j++)
            fout << v[j] << " ";
        fout << "\n";
    }
    for (int j = (v.size()==0 ? 1 : v[v.size()-1] + 1); j <= n; j++)
    {
        v.push_back(j);
        back();
        v.pop_back();
    }
}

int main()
{
    fin >> n >> k;
    back();
    return 0;
}