#include <fstream>

const int MAX_N(19);

int main (void)
{
	std::ifstream input("combinari.in");
	int n, k;
	input >> n >> k;
	input.close();
	int i, v [MAX_N] = {0};
	for (i = 1 ; i <= k ; ++i)
		v[i] = i;
	std::ofstream output("combinari.out");
	while (true)
	{
		for (i = 1 ; i <= k ; ++i)
			output << v[i] << ' ';
		output.put('\n');
		++v[k];
		if (v[k] > n)
		{
			i = k - 1;
			for (int j(n - 1) ; i && v[i] == j ; --i, --j)
				/* do nothing */;
			if (!i)
				break;
			++v[i];
			for (++i ; i <= k ; ++i)
				v[i] = v[i - 1] + 1;
		}
	}
	output.close();
	return 0;
}