//Sa se genereze toate combinarile de N luate cate K in ordine lexicografica.
#include <fstream>
#include <iostream>
using namespace std;
int x[20],n,k;
ofstream fout("combinari.out");

void afis(int k){
	for(int i =1 ;i <= k;i++)
		fout<<x[i]<<" ";
	fout<<endl;
}
void back(int j){
	for(int i = x[j-1]+1 ; i<=n ; i++){
		x[j] = i;
		if(j == k)
			afis(k);
		else
			back(j+1);
	}
}
int main(){
	ifstream fin("combinari.in"); fin>>n>>k; fin.close();
	back(1);
}