#include<iostream>
using namespace std;
void mul(int n,int *p)
{
	int sum,i,j;
	p[0]=1;
	for(j=1;j<=n;j++)
	{
	sum=1;
	for(i=1;i<=j;i++)
		sum*=i;
	p[j]=sum;
	}
}
int permrank(int n,int *pi,int *f)
{
	int r=0;
	int *rho,j,i;
	rho=new int[n];
	for(j=0;j<n;j++) rho[j]=pi[j];
	for(j=0;j<n;j++){
		r+=(rho[j]-1)*f[n-j-1];
		if(j+1<n)
		for(i=j+1;i<n;i++) if(rho[i]>rho[j]) rho[i]--;
	}
	delete rho;
	return r;
}
void permunrank(int n,int r,int *pi,int *f)
{
	pi[n-1]=1;
	int j,d,i;
	for(j=0;j<n-1;j++)
	{
		d=(r%f[j+2])/f[j+1];
		r-=d*f[j+1];
		pi[n-j-2]=d+1;
		for(i=n-j-1;i<n;i++) if(pi[i]>d) pi[i]++;
	}
}
int main()
{
	int n,*pi,i,r,m,j,*p;
	pi=new int[2048];
	p= new int[2049];
	cin>>m;
	for(j=0;j<m;j++){
		cin>>n>>r;
  for(i=0;i<n;i++)
	  cin>>pi[i];
  mul(n,p);
  permunrank(n,permrank(n,pi,p)+r,pi,p);
 for(i=0;i<n;i++)
	 cout<<pi[i]<<" ";
 cout<<endl;
	}
	delete pi;
	delete p;
 return 0;
}