#include <cstdio>
#include <algorithm>

using namespace std;

bool P[20];

int main() {
	freopen("combinari.in", "r", stdin);
	freopen("combinari.out", "w", stdout);
	int n, k;
	scanf("%d%d", &n, &k);
	for (int i = 0; i < k; i++) {
		P[i] = true;
	}
	do {
		for (int i = 0; i < n; i++) {
			if (P[i]) {
				printf("%d ", i + 1);
			}
		}
		printf("\n");
	} while (prev_permutation(P, P + n));
	return 0;
}