#include<iostream>
#include<fstream>
using namespace std;
int back[20];
int n, k;
ifstream f("combinari.in");
ofstream g("combinari.out");
void print()
{
	for (int i = 1; i <= k; i++)
		g << back[i] << " ";
	g << '\n';
}
void solve_for_back(int p)
{
	for (int i = back[p-1] + 1; i <= n; i++)
	{
		back[p] = i;
		if (p == k)
			print();
		else
			solve_for_back(p + 1);
	}
}


int main()
{
	f >> n >> k;
	solve_for_back(1);
}