#include<stdio.h>
using namespace std;
int i,n,m,k,x[20];
void back()
{
	k=1;
	x[k]=0;
	while(k>0)
	{
		while(k<=n&&x[k]<m)
		{
			x[k]++;
			if(k==n)
			{
				for(i=1;i<=n;i++)
					printf("%d ",x[i]);
				printf("\n");
			}
			else
			{
				k++;
				x[k]=x[k-1];
			}
		}
		k--;
	}
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d",&m);
scanf("%d",&n);
back();
return 0;
}