#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
#define int unsigned long long
#define all(x) (x).begin(), (x).end()
#define ls id << 1
#define rs id << 1 | 1

using i128 = __int128_t;

void solve(){
	int ac = 0, bc = 0;
	vector<int>a(10), b(10), av(10), bv(10), ark(10), brk(10);
	for(int i = 0;i < 10;i++){
		cin >> a[i];
		if(a[i]){
			av[ac] = i;
			ark[i] = ac++;
		}
	}
	for(int i = 0;i < 10;i++){
		cin >> b[i];
		if(b[i]){
			bv[bc] = i;
			brk[i] = bc++;
		}
	}

	string s;
	cin >> s;
	for(auto &c : s) {
		c = ark[c-'0'] + '0';
	}
	vector<i128>pw(s.size());
	vector<i128>pre(s.size());
	pw[0] = 1;
	for(int i = 1;i < pw.size();i++){
		pw[i] = pw[i-1] * ac;
		pre[i] = pw[i] + pre[i-1];
	}


	i128 x = 0;
	if(a[0]){
		for(int i = 0;i < s.size();i++){
			x += pw[s.size()-i-1] * (s[i]-'0');
		}
		x++;
	}else{
		x += pre[s.size()-1];
		//cerr << (int)x << endl;
		for(int i = 0;i < s.size();i++){
			x += ark[s[i]-'0'] * pw[s.size()-i-1];
		}
		x++;
	}

	if(x == 1){
		cout << bv[0] << endl;
		return;
	}

	s = "";
	if(b[0]){
		x--;
		while(x){
			s.push_back((x % bc) + '0');
			x /= bc;
		}
		reverse(s.begin(), s.end());
	}else{
		i128 pp = bc, len = 1;
		while(x > pp){
			len++;
			x -= pp;
			pp *= bc;
		}
		vector<i128>pw(len);
		pw[0] = 1;
		for(int i = 1;i < len;i++) pw[i] = pw[i-1] * bc;
		s = string(len, '0');
		for(int i = 0;i < len;i++){
			if(x > pw[len-i-1]) {
				s[i] += x / pw[len-i-1];
				x -= pw[len-i-1];
			}
		}
	}

	for(auto &c : s) {
		c = bv[c-'0'] + '0';
	}
	cout << s << endl;
}

signed main(){

	ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
	int t = 1;
	cin >> t;
	while(t--) solve();

	return 0;
}