//ALEXANDRU MICLEA

#include <vector>
#include <algorithm>
#include <string>
#include <queue>
#include <map>
#include <set>
#include <unordered_map>
#include <time.h>
#include <iomanip>
#include <deque>
#include <math.h>
#include <cmath>
#include <assert.h>
#include <stack>
#include <bitset>
#include <random>
#include <chrono>

using namespace std;

#include <fstream>
ifstream cin("combinari.in"); ofstream cout("combinari.out");

bool used[10];
int current[10];

void bt(int q, int n, int k) {
	if (q == k + 1) {
		for (int i = 1; i <= k; i++) {
			cout << current[i] << " ";
		}
		cout << '\n';
		return;
	}
	for (int i = q; i <= n; i++) {
		if (!used[i] && i >= current[q-1]) {
			current[q] = i;
			used[i] = true;
			bt(q + 1, n, k);
			used[i] = false;
		}

	}

}

int main() {

	int n, k;
	cin >> n >> k;
	bt(1, n, k);
	return 0;
}