#include <cstdio>

int n,p,sol[20];

void back(int k)
{
	if(k==p+1)
	{
		for(int i=1;i<=p;++i)
			printf("%d ",sol[i]);
	printf("\n");
	}
	else
	{
		if(k>1) sol[k]=sol[k-1];
		else 
				sol[k]=0;
		while(sol[k]<n-p+k)

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