#include<stdio.h>
int ans[30];
int n, m;
int cnt = 0;
void dfs(int x,int a,int b)
{
	if (a == 0)
	{
		for (int i = 1; i <= m; i++)printf("%d  ", ans[i]);
		printf("\n");
		cnt++;
		return;
	}
	for (int i = x + 1; i <= n; i++)
	{
		ans[b] = i;
		dfs(i, a - 1, b + 1);
	}
	return;
}
int main()
{
	scanf_s("%d %d", &n, &m);
	for (int i = 1; i <= n + 1 - m; i++)
	{
		ans[1] = i;
		dfs(i, m-1, 2);
	}
	//printf("%d", cnt);
	return 0;
}