#include<bits/stdc++.h>
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define ROF(i,a,b) for(int i=a;i>=b;i--)
#define fi first
#define se second
#define pb push_back
#define Mp make_pair
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int rd() {
	int r = 0; bool w = false; char ch = getchar();
	while( ch < '0' || ch > '9' ) w = !(ch^45), ch = getchar();
	while( ch >= '0' && ch <= '9' ) r = (r<<1) + (r<<3) + (ch^48), ch = getchar();
	return w ? -r : r;
}
ll rdl() {
	ll r = 0; bool w = false; char ch = getchar();
	while( ch < '0' || ch > '9' ) w = !(ch^45), ch = getchar();
	while( ch >= '0' && ch <= '9' ) r = (r<<1) + (r<<3) + (ch^48), ch = getchar();
	return w ? -r : r;
}

#define MAXL 100
char s[MAXL];
int avis[MAXL], bvis[MAXL];
int bnum[MAXL], bcnt, acnt;
int st[MAXL];
inline int quick_pow( int a , int p , int mod ) {
	int ret = 1;
	for(;p;p>>=1) {
		if( p & 1 ) ret = 1ll * ret * a % mod;
		a = 1ll * a * a % mod;
	}
	return ret;
}
void solve() {
	acnt = 0; FOR(i,0,9) avis[i] = rd(), acnt += avis[i];
	bcnt = 0;
	FOR(i,0,9) {
		bvis[i] = rd();
		if( bvis[i] ) bnum[++bcnt] = i;
	}
	
	FOR(i,1,9) avis[i] += avis[i-1];
	scanf("%s", s+1);
	int l = strlen(s+1);
	__int128 mul = 1;
	__int128 x = 0;
	ROF(i,l,1) 
		x += mul * (avis[s[i] - '0'] - 1), mul *= acnt;

	st[0] = 0;
	if( x == 0 ) st[st[0] = 1] = 0;
	while( x ) st[++st[0]] = x%bcnt, x/=bcnt;
	ROF(i,st[0],1) putchar('0' + bnum[st[i] + 1]); putchar('\n');
	return;
}

int main() {
	int T = rd(); while( T-- ) solve();
	return 0;
}