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

using namespace std;

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

int N,K;
vector <int> solution;

void Back(int p)
{
	int i;
	if (p > K)
		{
			for(i = 1;i <= K; ++i)
				fout <<solution[i] <<' ';
			fout <<'\n';
		}
	else
	for (i = solution[p-1] + 1; i <= N; ++i)
		{
			solution[p] = i;
			Back(p+1);
		}
}
int main()
{
	fin >>N >>K;
	solution.resize(N+1);
	Back(1);
	return 0;
}