#include <fstream>

using namespace std;

ifstream f("combinari.in");
ofstream g("combinari.out");

int n, k, a[20], used[20];

void back(int nivel)
{
	if (nivel == k + 1) {
		for (int i = 1; i <= k; i++)
			g << a[i] << " ";
		g << '\n';
	}
	else
		for (int i = 1; i <= n; i++)
			if (!used[i] && i > a[nivel - 1]) {
				a[nivel] = i;
				used[i] = 1;
				back(nivel + 1);
				used[i] = 0;
			}
}

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