#include <bits/stdc++.h>
#define st first
#define nd second
#define pb push_back
#define pf push_front
#define mp make_pair
#define ll long long

using namespace std;

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

int n, v; bool f[20]; int a[20];

void back(int k){
	if(k > v){
		for(int i = 1; i <= v; i++) out << a[i] << ' ';
		out << '\n';
		return; 
	}
	for(int i = a[k-1]+1; i <= n; i++){
		if(!f[i]){
			f[i] = 1; a[k] = i;
			back(k+1);
			f[i] = 0;
			
		}
	}
}

int main(){
	in >> n >> v;
	back(1);
	return 0;
}