#include <iostream>
#include <fstream>

using namespace std;

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

int n, k, v[100];
bool sol(int p)
{
	for (int i = 1; i < p; i++)
		if (v[i] >= v[p]) return 0;
	return 1;
}
void bk(int p)
{
	for (int i = 1; i <= n; i++)
	{
		v[p] = i;
		if(sol(p))
			if (p == k)
			{
				for (int j = 1; j <= k; j++)
					g << v[j] << " ";
				g << endl;
			}
			else bk(p + 1);
	}
}
int main()
{
	f >> n >> k;
	bk(1);

}