#include<bits/stdc++.h>
using namespace std;
#define lowbit(x) x&(-x)
#define int long long

const int N = 1e6+10;
int INF  = 1e9;
//int mod = 1e9+7;
//int mod =  1e9+7;
//int ways[4][2] = {{1,0},{-1,0},{0,1},{0,-1}};

int n,m;
int a[20],b[20];
map<int,int> ma,mb;
string ta;

void solve() {
    ma.clear();
    mb.clear();

    for(int i = 0;i<=9;i++) cin>>a[i];
    int ca = 0;
    for(int i = 0;i<=9;i++){
        if(a[i]) ma[i] = ca++;
    }

    for(int i = 0;i<=9;i++) cin>>b[i];
    int cb = 0;
    for(int i = 0;i<=9;i++){
        if(b[i]) mb[cb++] = i;
    }

    cin>>ta;

    int num = 0;

    for(int i = 0;i<ta.size();i++){
        num = num*ma.size() + ma[ta[i]-'0'];
    }

    string ans = "";

    if(num == 0) ans += mb[0]+'0';

    while(num){
        ans = (char)(mb[num%mb.size()]+'0') + ans;
        num /= mb.size();
    }

    cout<<ans<<endl;
    return;

}
signed main() {
    std::ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    //cout<<fixed<<setprecision(8);
    int caset = 1;
    cin>>caset;

    for(int i = 1;i<=caset;i++){
        //cout<<"Case "<<i<<": "<<endl;
		solve();
	}

    return 0;
}