#include <bits/stdc++.h>
using namespace std;
using ll=long long;
const int V=37,p2[6]={1,2,4,8,16,32},cc[5][5]={{1},{1,1},{1,2,1},{1,3,3,1},{1,4,6,4,1}};
ll ans{0ll};
int a[V];
bool key[V];
inline int getid(const string &s){
	switch(s.back()){
		case 'm':return s[0]-48; case 'p':return s[0]-48+9;
		case 's':return s[0]-48+18; case 'E':return 28; case 'S':return 29;
		case 'W':return 30; case 'N':return 31; case 'Z':return 32; case 'B':return 33; case 'F':return 34;
	} return 0;
}
inline void getcard(int id,char &ty,int &x){
	if(id<=9) ty='m',x=id;
	else if(id<=18) ty='p',x=id-9;
	else if(id<=27) ty='s',x=id-18;
	else ty="ESWNZBF"[id-28],x=0;
}
template <typename T>
inline void upd(T &a,T b){a=max(a,b);}
void solve1(){  // 3*4+2
	static long long f[V][16][2][5][5];
	memset(f,0,sizeof f),f[0][0][0][0][0]=1;
	for(int i{1};i<=34;++i){
		char ty;int idx; getcard(i,ty,idx);
		for(int j{0};j<=14&&j<=4*(i-1);++j)
			for(int k:{0,1}) for(int l:{0,1,2,3,4}) for(int u{0};u+l<=4;++u){
				ll me{f[i-1][j][k][l][u]};
				int cnt{a[i]-(l+u)},mxnews=(islower(ty)&&idx+2<=9)?cnt:0;
				for(int news{0};news<=mxnews&&j+l+u+news<=14;++news)
					for(int pr{0};pr+k<=1&&news+2*pr<=cnt&&j+l+u+news+pr*2<=14;++pr)
						for(int kz{0};news+2*pr+3*kz<=cnt&&j+l+u+news+pr*2+3*kz<=14;++kz){
							int ad{l+u+news+2*pr+3*kz};
							upd(f[i][j+ad][k||pr][news][l],me*cc[a[i]][ad]*p2[key[i]*ad]);
						}
		    }
	} upd(ans,f[34][14][1][0][0]);
}
void solve2(){
	static long long f[V][8];
	memset(f,0,sizeof f),f[0][0]=1;
	for(int i{1};i<=34;++i){
		char ty;int idx; getcard(i,ty,idx);
		for(int j{0};j<=7&&j<=2*(i-1);++j)
			for(int k{0};k<=1&&j+k<=7&&2*k<=a[i];++k)
                upd(f[i][j+k],f[i-1][j]*cc[a[i]][2*k]*p2[key[i]*2*k]);
	} upd(ans,f[34][7]*7ll);
}
void solve3(){
	const vector<int> req={1,9,10,18,19,27,28,29,30,31,32,33,34};
	for(int i:req) if(!a[i]) return ;
	long long mx{0ll};
	for(int i:req){
		if(a[i]<2) continue;
		long long s{1ll};
		for(int j:req)
			if(j==i) s*=cc[a[j]][2]*p2[key[j]*2];
			else s*=cc[a[j]][1]*p2[key[j]];
		upd(mx,s);
	} upd(ans,mx*13ll);
}
void solve(){
	fill(a+1,a+34+1,4),fill(key+1,key+34+1,false);
	string t;
	while(1){cin>>t;if(t=="0")break;--a[getid(t)];}
	while(1){cin>>t;if(t=="0")break;key[getid(t)]=true;}
	ans=0LL,solve1(),solve2(),solve3(),printf("%lld\n",ans);
}
int main(){
	cin.tie(0)->sync_with_stdio(0);
	int tc;cin>>tc;
	while(tc--)solve();
	return 0;
}