#include<cstdio>
using namespace std;
int x[30],n,k,p;
void scrie_sol(int k)
{
	int i;
	for(i=1;i<=k;i++)
	{
		printf("%d ",x[i]);
	}
	printf("\n");
}
int main()
{
	freopen("permutari.in","r",stdin);
	freopen("permutari.out","w",stdout);
	scanf("%d%d",&n,&p);
	k=1;
	x[k]=0;
	while(k!=0)
	{
		if(x[k]<n-p+k)
		{
			x[k]++;
			if(k==p)
			{
				scrie_sol(p);
			}
			else
			{
				k++;
				x[k]=x[k-1];
			}
		}
		else
		{
			k--;
		}
	}
	return 0;
}