#pragma GCC optimize("Ofast")
#pragma GCC optimize("inline")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#define rep(i,j,k) for(int i=j;i<=k;i++)
#define INT __int128
using namespace std;
int read(){
    char ch=getchar();int x=0,f=1;
    for(;ch<'0'||ch>'9';ch=getchar())if(ch=='-')f=-1;
    for(;ch>='0'&&ch<='9';ch=getchar())x=x*10+ch-'0';
    return f*x;
}
template<typename T> void write(T x){
    if(x>9)write(x/10);
    putchar(x%10+'0');
}
template<typename T> void Write(T x){
    write(x);putchar('\n');
}
int a[20],b[20];
int rka[20],rkb[20];
int tpa[20],tpb[20];
char Num[110];
char Ans[110];
INT poww(INT n,INT m){
    INT ret=1;INT temp=n;INT tmp=m;
    while(tmp){
        if(tmp&1)ret*=temp;
        temp*=temp;
        tmp>>=1;
    }
    return ret;
}
int main(){
    int T=read();
    while(T--){
        int tot1=0;
        rep(i,0,9){
            a[i]=read();
            tot1+=(a[i]==1);
            if(a[i]){
                rka[i]=tot1;
                tpa[tot1]=i;
            }
        }

        int tot2=0;
        rep(i,0,9){
            b[i]=read();
            tot2+=(b[i]==1);
            if(b[i]){
                rkb[i]=tot2;
                tpb[tot2]=i;
            }
        }

        scanf("%s",Num+1);
        int len=strlen(Num+1);

        __int128 Tim=0;
        rep(i,1,len){
            int x=Num[i]-'0';
            int rk=rka[x];
            if(a[0]){
                Tim+=poww(tot1,len-i)*(rk-1);
            }else{
                Tim+=poww(tot1,len-i)*rk;
                if(i==len)Tim--;
            }
        }

        int anslen=1;
        __int128 sum=tot2;
        if(b[0]){
            while(poww(tot2,anslen)-1<Tim)anslen++;
        }else{
            while(sum-1<Tim){
                anslen++;
                sum+=poww(tot2,anslen);
            }
        }
        sum=0;
        rep(i,1,anslen-1)sum+=poww(tot2,i);

        rep(i,1,anslen){
            if(i!=anslen)sum-=poww(tot2,anslen-i);
            __int128 tmp=poww(tot2,anslen-i);
            int cnt=0;
            while(Tim-tmp>=sum){
                Tim-=tmp;
                cnt++;
            } 
            if(b[0]){
                int x=tpb[cnt+1];
                Ans[i]=x+'0';
            }else{
                if(i==anslen)cnt++;
                int x=tpb[cnt];
                Ans[i]=x+'0';
            }
            
        }

        rep(i,1,anslen)putchar(Ans[i]);
        putchar('\n');
    }
    return 0;
}
/*
4
1 0 1 0 0 0 0 0 0 0
1 1 0 0 0 0 0 0 0 0
20
0 1 1 0 0 0 0 0 0 0
1 0 0 1 0 0 0 0 0 0
2
0 1 1 0 0 0 0 0 0 0
0 1 0 1 0 0 0 0 0 0
12
0 0 1 1 0 0 0 0 0 0
0 1 0 1 0 1 0 0 0 0
32223

*/