#include <cstdio>
#include <cstdlib>

int n, k, *a;

void print_sol()
{
	for (int i=1; i<=k; i++)
		printf("%d ", a[i]);
	printf("\n");
}

void solve(int pos)
{
	for ( int i=a[pos-1]+1; i<=n; i++ )
	{
		a[pos] = i;
		if ( pos < k )
			solve(pos+1);
		else
			print_sol();
	}
}

int main()
{
	freopen("combinari.in", "r", stdin);
	freopen("combinari.out", "w", stdout);

	scanf("%d%d", &n, &k);

	a = (int*) calloc( k+1, sizeof(int) );

	solve(1);
}