#include <iostream>
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
const int maxn = 20;
int v[maxn];
int n, k;

void back( int pas, int val )
{
	if( pas == k+1 )
	{
		for( int i = 1; i <= k; ++i )
			g << v[i] << ' ';
		g << '\n';
	}
	else
	{
		for( int i = val+1; i <= n; ++i )
		{
			v[pas] = i;
			back( pas+1, i );
		}
	}
}

int main()
{
	f >> n >> k;
	back( 1, 0 );
	return 0;
}