#include <bits/stdc++.h>

using namespace std;

#ifdef lisie_bimbi
#else
#define endl '\n'
#endif

#pragma GCC optimize("O2")
#define int long long
typedef long long ll;

void solve(){
    vector<ll> a(10), b(10);
    for(int i = 0; i < 10; i++){
        cin >> a[i];
    }
    for(int i = 0; i < 10; i++){
        cin >> b[i];
    }
    for(int i = 1; i < 10; i++){
        a[i] += a[i - 1];
    }
    string s;
    cin >> s;
    int n = s.size();
    vector<int> st(n);
    st[0] = 1;
    for(int i = 1; i < n; i++){
        st[i] = st[i - 1] * a[9];
    }
    __int128 x = 0;
    for(int i = 0; i < n; i++){
        int t = s[i] - '0';
        t = a[t] - 1;
        x += t * st[n - i - 1];
    }
    vector<int> b1;
    for(int i = 0; i < 10; i++){
        if(b[i]){
            b1.push_back(i);
        }
    }
    string ans;
    int sz = b1.size();
    x++;
    if(b[0]){
        while(x > 0){
            ans += ('0' + b1[x % sz]);
            x /= sz;
        }
        reverse(ans.begin(), ans.end());
        if(ans.empty()){
            ans += '0';
        }
        cout << ans << endl;
    }else{
        __int128 s = 1;
        while(s < x){
            x -= s;
            s *= sz;
        }
        while(x > 0){
            ans += ('0' + b1[x % sz]);
            x /= sz;
        }
        reverse(ans.begin(), ans.end());
        if(ans.empty()){
            ans += '0';
        }
        cout << ans << endl;
    }
}

signed main(){
#ifdef lisie_bimbi
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#else
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);    
#endif     
    ll t;
    cin >> t;
    while(t--){
        solve();
    }
}