using namespace std;
#include<cstdio>
int n,k,i,sol[20];

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

void back(int p)
{
	if(p==k+1) afis();
	else
	{
		if(p==1) sol[p]=0;
		else sol[p]=sol[p-1];
		while(sol[p]<n-k+p)
		{
			sol[p]++;
			back(p+1);
		}
		
	}
}

int main()
{
	freopen("combinari.in","r",stdin);
	freopen("combinari.out","w",stdout);
	scanf("%d%d",&n,&k);
	back(1);
	return 0;
}