#include<bits/stdc++.h>
using namespace std;
#define ri int
typedef long long ll;
const int maxn=1e5+10;
template<class T>inline bool ckmin(T &x,const T &y){return x>y?x=y,1:0;}
template<class T>inline bool ckmax(T &x,const T &y){return x<y?x=y,1:0;}
template<class T>inline void clear(T *arr,int siz,int val=0){memset(arr,val,sizeof(T)*(siz+1));}
map<vector<int>,int>id;
vector<vector<int>>p;
inline void init(){
	vector<int>a(6);
	iota(a.begin(),a.end(),0);
	do id[a]=p.size(),p.push_back(a);while(next_permutation(a.begin(),a.end()));
}
inline vector<int> encode(vector<int> a){
	sort(a.begin(),a.end());
	ri xsum=0;
	for(ri i:a)xsum^=i;
	for(ri i=0;i<a.size();i+=6){
		if((i/6)&1)reverse(a.begin()+i,a.begin()+min(i+6,(int)a.size()));
		if(i+6<=a.size()){
			vector<int>b(6),&c=p[xsum];
			for(ri j=0;j<6;++j)b[j]=a[i+c[j]];
			for(ri j=0;j<6;++j)a[i+j]=b[j];
		}
	}
	return a;
}
inline int get_id(const vector<int> &a,int p,bool t){
	typedef pair<int,int> pii;
	#define fi first
	#define se second
	vector<pii>b(6);
	for(ri i=0;i<6;++i)b[i]={a[p+i],i};
	if(t)sort(b.begin(),b.end(),greater<pii>());
	else sort(b.begin(),b.end());
	vector<int>c(6);
	for(ri i=0;i<6;++i)c[b[i].se]=i;
	return id[c];
}
inline vector<int>decode(vector<int> a){
	if(encode(a)==a)return a;
	ri B=(a.size()+1)/6;
	for(ri i=0;i<B;++i){
		ri lst=-1;
		for(ri j=0;j<B;++j)
			if(i!=j){
				ri cur=get_id(a,j*6-(i<j),j&1);
				if(lst==-1)lst=cur;
				else if(cur!=lst)goto skip;
			}
		for(ri i:a)lst^=i;
		a.push_back(lst);
		return a;
		skip:;
	}
	ri xsum=get_id(a,0,0);
	for(ri i:a)xsum^=i;
	a.push_back(xsum);
	return a;
}
char s[123];
int n,t_case;
int main(){
	init();
	scanf("%s%d",s+1,&t_case);
	while(t_case--){
		scanf("%d",&n);
		vector<int>a(n);
		for(ri &i:a)scanf("%d",&i);
		if(s[1]=='t')a=encode(a);
		else a=decode(a);
		for(ri i:a)printf("%d ",i);
		printf("\n");
	}
	return 0;
}