#include <iostream>
#include <fstream>
#include <cmath>
#include <vector>
#include <queue>
#include <deque>
#include <list>
#include <string>
#include <algorithm>
using namespace std;
ifstream ff("combinari.in");
ofstream gg("combinari.out");

int n, k, oo[20];
bool ww[20];

void gen(int i){
	if(oo[i]+1<=i+(n-k)){ oo[i]++; return; }
	gen(i-1);
	oo[i]=oo[i-1]+1;
}

void com(){
	for(int i=1;i<=k;i++){ oo[i]=i; ww[i]=1; }
	do{
		for(int i=1;i<=k;i++) gg << oo[i] << " "; gg << "\n";
		gen(k);
	}while(oo[0]==0);
}

int main(){
	ff >> n >> k;
	com();	
	return 0;
}