#include <bits/stdc++.h>

using namespace std;

#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--)
#define SZ(a) int(a.size())
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first
#define S second
 
typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef double db;

void solve()
{
	map<int, int> m1, m2;
	int cnt1 = 0;
	int cnt2 = 0;
	FOR (i, 0, 10)
	{
		int a;
		cin >> a;
		if (a)
		{
			m1[i] = cnt1;
			cnt1++;
		}
	}
	bool is_zer = false;
	FOR (i, 0, 10)
	{
		int a;
		cin >> a;
		if (a)
		{
			if (i == 0)
				is_zer = 1;
			m2[cnt2] = i;
			cnt2++;
		}
	}
	__int128 x = 0;
	string s;
	cin >> s;
	reverse(ALL(s));
	__int128 pw = 1;
	FOR (i, 0, SZ(s))
	{
		int d = s[i] - '0';
		x += pw * m1[d] + (i == 0 || m1.count(0) ? 0 : pw);
		pw *= cnt1;
	}
	string res = "";
	int i = 0;
	while (x)
	{
		if (!is_zer && i)
			x--;
		int d = x % cnt2;
		
		res += ('0' + m2[d]);
		x /= cnt2;
		i++;
	}
	reverse(ALL(res));
	if (res.empty())
		res += ('0' + m2[0]);
	cout << res << '\n';
}

int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	int t;
	cin >> t;
	while (t--)
	{
		solve();
	}
	
	
	return 0;
}