/*
 * Autor: Paul Herman
 * Problema: Combinari
 * Data: 14.10.2011
 * Punctaj: 100
 * Link: http://www.infoarena.ro/problema/combinari
 */
#include <fstream>
using namespace std;

int n, k;
int combinare[19];
bool folosit[19];
ofstream fout;

inline void scriere()
{
	for (int i = 1; i <= k; i++)
		fout << combinare[i] << ' ';
	fout << '\n';
}
void bkt(int p)
{
	if (p == k)
		scriere();
	else
	{
		for (int i = combinare[p] + 1; i <= n; i++)
		{
			if (folosit[i] == false)
			{
				folosit[i] = true;
				combinare[p + 1] = i;
				bkt(p + 1);
				folosit[i] = false;
			}
		}
	}
}
inline void citire()
{
	ifstream fin("combinari.in");
	fin >> n >> k;
	fin.close();
}
int main()
{
	fout.open("combinari.out");
	bkt(0);
	fout.close();
}