#include <bits/stdc++.h> 
using namespace std;
#define int long long
#define endl '\n'
#define base 191
#define mod 1145141
#define inf 0x3f3f3f3f3f3f3f3f
const int N = 1e7 + 10;
int a[15], b[15];
int prea[15], preb[15];
int suma, sumb;
void solve() {
	map<int, int> mp;
	for (int i = 0; i <= 9; ++i) {
		cin >> a[i];
		suma += a[i];
		if (i != 0) {
			prea[i] = prea[i - 1] + a[i];
		}
		else {
			prea[i] = a[i];
		}
	}
	int cnt = 0;
	for (int i = 0; i <= 9; ++i) {
		cin >> b[i];
		sumb += b[i];
		if (b[i] == 1) {
			mp[cnt] = i;
			cnt++;
		}
		if (i != 0) {
			preb[i] = preb[i - 1] + b[i];
		}
		else {
			preb[i] = b[i];
		}
	}
	string x;
	cin >> x;
	if (suma == sumb) {
		for (int i = 0; i < x.size(); ++i) {
			for (int j = 0; j <= 9; ++j) {
				if (preb[j] == prea[x[i] - '0']) {
					cout << j;
					break;
				}
			}
		}
		cout << endl;
		return;
	}
	else {
		int num = (prea[x[x.size() - 1] - '0']) ;
		int ans = suma;
		for (int i = x.size() - 2; i >= 0; --i) {
			num += (prea[x[i] - '0'] - 1) * ans;
			ans *= suma;
		}
		stack<int> s;
		num--;
		while(num){
			s.push(mp[num % sumb]);
			num /= sumb;
		}
		while (s.size()) {
			cout << s.top();
			s.pop();
		}
		cout << endl;
	}
}

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

/*
1
1 0 1 0 0 0 0 0 0 0
1 1 0 0 0 0 0 0 0 0
20*/