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

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

vector<vector<int>> res;
unordered_set<int> visited;

void back(int index,int stop, vector<int>& domain, vector<int>& solution) {
	if(index == stop) {
		for(int x : solution) {
			fout<<x<<" ";
		}
		fout<<endl;
		return;
	}
	for(int i=index;i<domain.size();i++) {
		if(domain[i] < solution[index-1]) continue;
		if(visited.find(domain[i]) == visited.end()) {
			visited.insert(domain[i]);

			solution[index] = domain[i];

			back(index+1, stop, domain, solution);
			visited.erase(domain[i]);
		}
	}
}

int main() {

	int n, k;
	fin>>n>>k;
	vector<int> domain(n);
	vector<int> solution(k);
	for(int i=0;i<n;i++) {
		domain[i] = i + 1;
	}
	back(0, k, domain, solution);
	return 0;
}