#include<stdio.h>
#include<algorithm>
#include<vector>

using namespace std;

int main()
{
	freopen("combinari.in", "r", stdin);
	freopen("combinari.out", "w", stdout);

	int n, m;
	scanf("%d%d", &n, &m);

	vector<bool> v(n);
	fill(v.begin() + m, v.end(), true);

	for(int t = 1 ; t ; t = next_permutation(v.begin(), v.end())) {
		for(int i = 0 ; i < n ; ++i)
			if(!v[i])
				printf("%d ", i+1);
		printf("\n");
	}


	return 0;
}