#include <cstdio>
#include <algorithm>
#include <cstring>

using namespace std;

int x[20];
int n, k;

int main ()
{
	freopen ("combinari.in", "r", stdin);
	freopen ("combinari.out", "w", stdout);
	scanf ("%d %d", &n, &k);
	
	int i;

	memset (x, 1, sizeof (x));

	for (i = 1; i <= k; ++i)
		x[i] = 0;

	do
	{
		for (i = 1; i <= n; ++i)
			if (!x[i])
				printf ("%d ", i);
		printf ("\n");
	}while (next_permutation (x + 1, x + n +1));




	return 0;
}