#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

#include <bits/stdc++.h>
//#define int long long
//#define LL long long
#define double long double
//#define lf Lf
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define endl "\n"
#define PII pair<int,int>
#define Gheap priority_queue<int,vector<int>,greater<int>>
#define Lheap priority_queue<int>
#define MAXN 0x3f3f3f3f
#define MINN -0x3f3f3f3f
using namespace std;
//const int N=1e6+100,M=2*N;
//int e[N],w[M],h[M],ne[M],idx;

void solve()
{
	map<char,int> mp;
	string na;
    string a,b;
    int idx=0;
    for(int i=0;i<10;i++)
    {
    	int num;cin>>num;
    	if(num) a+=char('0'+i);
    }
    for(int i=0;i<10;i++)
    {
    	int num;cin>>num;
    	if(num) mp[a[idx++]]=i;
    }
    cin>>na;

    for(auto z:na) cout<<mp[z];
    cout<<endl;

}

int main()
{
    std::ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int tt=1;
    cin >> tt;
    while(tt--) solve();
}