#include<bits/stdc++.h>
using namespace std;
typedef unsigned long long Big;
int T,x,pos1[11],pos2[11],ans[10005]; char s[1005];
vector<int> a,b;
int main(){
    for (cin>>T; T; T--){
        a.clear(),b.clear();
        for (int i=0; i<10; i++) pos1[i]=pos2[i]=0;
        for (int i=0; i<10; i++){
            scanf("%d",&x);
            if (x) a.push_back(i),pos1[i]=a.size()-1;
        }
        for (int i=0; i<10; i++){
            scanf("%d",&x);
            if (x) b.push_back(i),pos2[i]=b.size()-1;
        }
        scanf("%s",s+1); int n=strlen(s+1);
        Big pw=1,cnt=0;
        if (a[0]==0){
            for (int i=n; i>=1; i--){
                cnt+=pw*pos1[s[i]-'0'];
                pw*=a.size();
            }
        } else {
            for (int i=n; i>=1; i--){
                cnt+=pw*(pos1[s[i]-'0']+1);
                pw*=a.size();
            }
            cnt--;
        }
        if (!cnt){
            printf("%d\n",b[0]);
            continue;
        }
        
        if (b[0]==0){
            int len=0;
            while (cnt) ans[++len]=b[cnt%b.size()],cnt/=b.size();
            reverse(ans+1,ans+1+len);
            for (int i=1; i<=len; i++) putchar(ans[i]+'0');puts("");
        } else {
            cnt++; int k=0; Big P=1,sum=0;
            while (1){
                P*=b.size(); k++;
                if (P+sum>=cnt) break;
                sum+=P;
            }
            cnt-=sum+1;
            for (int i=1; i<=k; i++) ans[i]=b[cnt%b.size()],cnt/=b.size();
            reverse(ans+1,ans+1+k);
            for (int i=1; i<=k; i++) putchar(ans[i]+'0'); puts("");
        }
    }
}
/*
1
0 1 1 0 0 0 0 0 0 0
0 0 0 1 1 0 0 0 0 0
112
*/