#include<bits/stdc++.h>
using namespace std;
#define fr(i,a,b) for(int i=a;i<=b;i++)
#define ull unsigned long long
#define mod 998244353
#define N 105
#define M 505
char typ[N];
int T,n,a[N];
ull Seed;
void init(int rS){
	Seed=rS;
}
ull rd(){
	Seed ^= Seed << 13;
	Seed ^= Seed >> 7 ;
	Seed ^= Seed << 17;
	return Seed;
}
void rdsf(int* a,int n){
	for(int i=n;i;i--)swap(a[i],a[rd()%i+1]);
}
namespace encode{
	void solve(){
		scanf("%d",&n);
		fr(i,1,n)scanf("%d",&a[i]);
		sort(a+1,a+n+1);
		int xs=0;
		fr(i,1,n)xs^=a[i];
//		printf("xor:%d\n",xs);
		init(xs);
		rdsf(a,n);
		fr(i,1,n)printf("%d ",a[i]);puts(""); 
	}
}
namespace decode{
	int ori[N],vis[M];
	bool chck(int p){
		int j=1;
		fr(i,1,n){
			if(a[j]==p)++j;
			if(a[j]!=ori[i])return 0;
			j++;
		}
		return 1;
	}
	void solve(){
		scanf("%d",&n);
		fr(i,1,n)scanf("%d",&a[i]);
		fr(i,0,M-1)vis[i]=0;
		fr(i,1,n)vis[ori[i]=a[i]]=1;
		sort(a+1,a+n+1);
		int xs=0;
		fr(i,1,n)xs^=a[i];
		init(xs);
		rdsf(a,n);
		if(chck(0)){
			fr(i,1,n)printf("%d ",a[i]);puts(""); 
			return ;
		}
		fr(i,0,511){
//			printf("n:%d\n",n);
			fr(j,1,n)a[j]=ori[j];
			a[n+1]=i^xs;
			if(a[n+1]<1||a[n+1]>500||vis[a[n+1]])continue;
			sort(a+1,a+n+2);
			init(i);
			rdsf(a,n+1);
//			if(i==127){
//				fr(j,1,n+1)printf("%d ",a[j]);puts(""); 
//			}
			if(chck(i^xs)){
				fr(j,1,n+1)printf("%d ",a[j]);puts(""); 
				return ;
			}
		}
	}
}
int main(){
	scanf("%s%d",typ,&T);
	if(typ[0]=='t'){
		while(T--)encode::solve();
	}
	else {
		while(T--)decode::solve();
	}
	return 0;
}
/*
r
2
19 459 58 405 426 378 325 333 267 296 99 32 87 467 388 374 97 98 271 330
20 495 444 86 32 494 68 150 125 120 481 339 451 192 61 136 26 281 292 118 100
*/