#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;
}

#define MAXL 64
int avis[10], bvis[10];
int acnt, bcnt, bnum[10];
char s[MAXL+5];
int st[MAXL+5];
void solve() {
	acnt = bcnt = 0;
	FOR(i,0,9) avis[i] = rd(); FOR(i,0,9) bvis[i] = rd();
	FOR(i,0,9) if( avis[i] == 1 ) ++acnt;
	FOR(i,0,9) if( bvis[i] == 1 ) bnum[bcnt++] = i;
	FOR(i,1,9) avis[i] += avis[i-1];
	scanf("%s",s+1);
	__int128 x = 0; int len = strlen(s+1);
	FOR(i,1,len) {
		x = x * acnt + avis[s[i]-'0'] - 1;
	}
	if( !x ) st[st[0] = 1] = 0;
	else st[0] = 0;
	while( x ) {
		st[++st[0]] = x % bcnt, x /= bcnt;
	}
	ROF(i,st[0],1) putchar('0' + bnum[st[i]]); putchar('\n');
	return;
}

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