#include<cstdio>
#include<algorithm>

using namespace std;
int n,v[10],i,k;
int main()
{	
	freopen("combinari.in","r",stdin);
	freopen("combinari.out","w",stdout);
	scanf("%d%d",&n,&k);
	for(i=k+1;i<=n;i++)
		v[i]=1;
	do{
		for(i=1;i<=n;i++)
			if(!v[i])
				printf("%d ",i);
		printf("\n");
	}while(next_permutation(v+1,v+n+1));
	return 0;
}