#include <fstream>
using namespace std;

short n, p, v[18];
bool f[18];

ofstream fout ("combinari.out");

void Back (int k)
{
	for (int i = 0; i < n; ++i)
		if ((k && !f[i] && i + 1 > v[k-1]) || !k)
		{
			f[i] = 1;
			v[k] = i + 1;
			if (k < p - 1)
				Back (k + 1);
			else
			{
				for (int i = 0; i < p; ++i)
					fout << v[i] << " ";
				fout << "\n";
			}
			f[i] = 0;
		}
}
			

int main ()
{
	ifstream fin ("combinari.in");
	fin >> n >> p;
	fin.close();
	Back (0);
	fout.close();
	return 0;
}