#include <bits/stdc++.h>
#define rep(i,j,k) for(int i=j;i<=(k);++i)
#define drp(i,j,k) for(int i=j;i>=(k);--i)
#define MAXN 1000005
typedef long long ll;
typedef __int128 i128;
inline int read(){
	int x=0;
	bool sgn=true;
	char ch=getchar();
	while(!isdigit(ch)) sgn^=ch=='-',ch=getchar();
	while(isdigit(ch)) x=(x<<3)+(x<<1)+(ch^48),ch=getchar();
	return sgn?x:-x;
}
inline void chkmin(int &x,int y){x=std::min(x,y);}
int a[MAXN],b[MAXN];
std::string s;
std::vector<int> v1,v2;
inline void init(){
	std::vector<int>().swap(v1);
	std::vector<int>().swap(v2);
}
inline void solve(){
	i128 cur=1,x=0;
	std::string ans;
	rep(i,0,(int)s.length()-1){
		int pos=std::lower_bound(v1.begin(),v1.end(),s[i]-'0')-v1.begin();
		x+=pos*cur,cur*=v1.size();
	}
	if(!x) ans+=v2[0]+'0';
	else while(x){
		int cur=x%v2.size();
		ans+=v2[cur]+'0',x/=v2.size();
	}
	std::reverse(ans.begin(),ans.end());
	std::cout<<ans<<'\n';
}
int main(){
	drp(task,read(),1){
		init();
		rep(i,0,9) a[i]=read();
		rep(i,0,9) b[i]=read();
		std::cin>>s,std::reverse(s.begin(),s.end());
		rep(i,0,9) if(a[i]) v1.push_back(i);
		rep(i,0,9) if(b[i]) v2.push_back(i);
		solve();
	}
}