#include <iostream>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
void back(int step,int n,int k,vector<int>&sol,int start){
	if(sol.size()==k){
		for(int i=0;i<sol.size();i++){
			printf("%d ",sol[i]);
		}
		printf("\n");
		return;
	}
	for(int i=start;i<=n;i++){
		sol.push_back(i+1);
		back(i+1,n,k,sol,i+1);
		sol.pop_back();
	}
	return;

}
int main(){
	freopen("combinari.in","r",stdin);
	freopen("combinari.out","w",stdout);
	int n,k;
	scanf("%d %d",&n,&k);
	//printf("%d %d",n,k);
	vector<int> sol;
	back(0,n,k,sol,0);
	return 0;
}