#include<cstdio>
#include<algorithm>
using namespace std;

int a[20],n,i,p;

int main()
{
	
	freopen("combinari.in","r",stdin);
	freopen("combinari.out","w",stdout);
	scanf("%d %d",&n,&p);
	for(i=p+1;i<=n;i++)
		a[i]=1;

	do
	{
	for(i=1;i<=n;i++)
		if(!a[i])
	   printf("%d ",i);
	   printf("\n");
	} while(next_permutation(a+1,a+n+1));
	return 0;
}