#include<cstdio>
#include<bitset>
using namespace std;
#define NM 19
#define sh short int
sh N,M,sol[NM];
void back(sh p)
{
	sh i;
	if (p==M+1)
	{
		for (i=1; i<=M; ++i)
			printf("%hd ",sol[i]);
		printf("\n");
		return;
	}
	for (i=sol[p-1]+1; i<=N-M+p; ++i)
	{
		sol[p]=i;
		back(p+1);
	}
}
int main()
{
	freopen("combinari.in","r",stdin);
	freopen("combinari.out","w",stdout);
	scanf("%hd%hd",&N,&M);
	back(1);
	return 0;
}