#include <fstream>
#include <stack>
#include <queue>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <set>
#include <cstring>
#include <map>
#include <string>
#include <bitset>
#include <unordered_map>
#include <unordered_set>
#define oo 2000000
#define MOD 1000000007
using namespace std;

ifstream fin("combinari.in");
ofstream fout("combinari.out");
int st[25], fr[25],n,k;
void Back(int top)
{
	if (top > k)
	{
		for (int i = 1; i <= k; i++)
			fout << st[i] << " ";
		fout << endl;
		return;
	}
	for (int i = st[top-1]+1; i <= n; i++)
	{
			st[top] = i;
			Back(top + 1);
		
	}
}
int main()
{
	fin >> n>>k;
	Back(1);


}