#include <cstdio>
using namespace std;

int main()
{

	int n, k;
	int it;

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

	scanf("%d%d", &n, &k);
	int num[k], max[k];
	for(int i = 0; i < k; ++i)
	{
		num[i] = i + 1;
		max[i] = i + n - k + 1;
	}

	it = k-1;
	while(num[0] < max[0])
	{
		for(int i = 0; i < k; ++i)
			printf("%d ", num[i]);
		printf("\n");

		if(num[it] < max[it])
			num[it]++;
		else
			num[--it]++;
	}
	
    for(int i = 0; i < k; ++i)
        printf("%d ", num[i]);
    printf("\n");

	return 0;
}