#include <iostream>
using namespace std;
int n ,m;
int a[1005];
int visit[1005];
int dfs(int x) {
	if (x == m) {
		for (int i = 0 ;i < m ;i++) {
			printf("%3d" ,a[i]);
		}
		cout << endl;
	} else {
		for (int i = a[x - 1] + 1 ;i <= n ;i++) {
			if (visit[i] == 0) {
				visit[i] = 1;
				a[x] = i;
				dfs(x + 1);
				visit[i] = 0;
			}
		}
	}
}
int main () {
	cin >> n >> m;
	dfs(0);
	return 0;
}