#include <fstream>
#include <vector>
#include <string>
#include <map>
#include <unordered_map>
#include <queue>
#include <deque>
#include <cmath>
#include <algorithm>

using namespace std;

ifstream cin("combinari.in");
ofstream cout("combinari.out");

int n, k;
vector<int> numbers;

void print() {
	for (int i = 0; i < k; ++i) {
		cout << numbers[i] << ' ';
	} cout << '\n';
}

void generate(int currentNum) {
	if (numbers.size() == k) {
		print();
	}
	else {
		for (int num = currentNum; num <= n; ++num) {
			numbers.push_back(num);
			generate(num + 1);
			numbers.pop_back();
		}
	}
}

int main() {
	cin.sync_with_stdio(false);
	cout.sync_with_stdio(false);
	
	cin >> n >> k;
	generate(1);

	return 0;
}