#include <iostream>
#include <fstream>

using namespace std;

#define MAX_n 18

int n, k, v[MAX_n + 1];
bool vazut[MAX_n + 1];

ifstream fin("combinari.in");
ofstream fout("combinari.out");

void f(int pos)
{
	if (pos == k + 1)
	{
		for (int i = 1; i <= k; ++i)
			fout << v[i] << " ";
		fout << '\n';
	}
	else
	{
		for (int i = v[pos - 1] + 1; i <= n; ++i)
		{
			if (vazut[i] == 0)
			{
				v[pos] = i;
				vazut[i] = 1;
				f(pos + 1);
				vazut[i] = 0;
			}
		}
	}
}

int main()
{
	fin >> n >> k;
	f(1);
}