#include<bits/stdc++.h>
using namespace std;

#define int long long

using ll=__int128;

const int N=71;

int T;

ll f[N][2][2];

int a[10],b[10];

string s;

ll dfs(int x,int lead,int up)
{
    if(x==s.size())
        return !lead;
    if(f[x][lead][up]!=-1)
        return f[x][lead][up];
    ll &ret=f[x][lead][up];
    ret=0;
    for(int i=0;i<=(up?s[x]-'0':9);i++)
    {
        if(!a[i])
            continue;
        int nlead=lead&&!i;
        int nup=up&&i==s[x]-'0';
        ret+=dfs(x+1,nlead,nup);
    }
    return ret;
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cin>>T;
    while(T--)
    {
        memset(f,-1,sizeof(f));
        for(int i=0;i<10;i++)
            cin>>a[i];
        for(int i=0;i<10;i++)
            cin>>b[i];
        cin>>s;
        ll cnt=dfs(0,1,1);
        if(a[0])
            cnt++;
        if(b[0])
        {
            if(cnt==1)
            {
                cout<<"0\n";
                continue;
            }
            cnt--;
        }
        int cb=accumulate(b,b+10,0);
        vector<ll> pw({1});
        ll S=0;
        for(int i=1;;i++)
        {
            ll ways=pw.back();
            int fd=0;
            for(int j=1;j<10;j++)
            {
                if(!b[j])
                    continue;
                if(S+ways>=cnt)
                {
                    string ans;
                    ans+=to_string(j);
                    pw.pop_back();
                    for(int k=i-1;k>=1;k--)
                    {
                        ll ways=pw.back();
                        pw.pop_back();
                        for(int j=0;j<10;j++)
                        {
                            if(!b[j])
                                continue;
                            
                            if(S+ways>=cnt)
                            {
                                ans+=to_string(j);
                                break;
                            }
                            else
                                S+=ways;
                        }
                    }
                    cout<<ans<<"\n";
                    fd=1;
                    break;
                }
                else
                    S+=ways;
            }
            if(fd)
                break;
            pw.push_back(pw.back()*cb);
        }
    }
}