#include <iostream>
#include <vector>
#include <algorithm>
#include <fstream>

using namespace std;

ifstream fin("combinari.in");
ofstream fout("combinari.out");

void printSol(vector<int>& sol) {
	for (int i = 0; i < sol.size(); i++)
		fout << sol[i] << " ";
	fout << '\n';
}

void bt(int step, int start, int k, int n, vector<int>& sol) {
	if (step == k) {
		printSol(sol);
		return;
	}

	for (int i = start; i <= n; i++) {
		sol.push_back(i);
		bt(step + 1, i + 1, k, n, sol);
		sol.pop_back();
	}
}

int main() {
	int n, k;
	fin >> n >> k;
	vector<int> sol;
	bt(0, 1, k, n, sol);
}