#include <iostream>
#include <fstream>
using namespace std;

const int MAX_N = 18;
int s[MAX_N + 1];
int n, k;

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

void back(int l) {
	if (l == k) {
		for (int i = 1; i <= k; ++i)
			fout << s[i] << ' ';
		fout << endl;
	} else {
		for (int i = s[l] + 1; i <= n; ++i) {
			s[l + 1] = i;
			back(l + 1);
		}
	}
}

int main() {
	fin >> n >> k;
	back(0);
	return 0;
}