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

#define int long long
const int N = 1e5 + 10;

int a[10], mpa[10], mpa2[10], tota;
int b[10], mpb[10], mpb2[10], totb;

void solve()
{
    tota = -1;
    totb = -1;
    for(int i = 0; i < 10; i++)
    {
        cin >> a[i];
        if(a[i])
        {
            mpa[++tota] = i; 
            mpa2[i] = tota;
        }
    }
    for(int i = 0; i < 10; i++)
    {
        cin >> b[i];
        if(b[i])
        {
            mpb[++totb] = i; 
            mpb2[i] = totb;
        }
    }

    int x;
    cin >> x;
    int tmp = x;
    for(int p = 1; tmp; p *= 10, tmp /= 10)
    {
        x -= tmp % 10 * p;
        x += mpa2[tmp % 10] * p;
    } 

    // cerr << x << '\n';//10

    int base = tota + 1;
    //x(jz)
    int rk = 0;
    for(int p = 1; x; p *= base, x /= 10)
    {
        rk += x % 10 * p;
    }       

    if(rk == 0)
    {
        cout << mpb[0] << '\n';
        return;
    }

    // cerr << rk << '\n';//2

    string res = "";
    base = totb + 1;
    for(; rk; rk /= base)
    {
        res += rk % base + '0';
        // cerr << "???? " << '\n';
    }

    // cerr << res << '\n';//10

    string ans = "";
    for(; res != "";)
    {
        int t = res.back() - '0';
        res.pop_back();
        ans += mpb[t] + '0';
    }

    cout << ans << '\n';
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);cout.tie(0);

    int t = 1;
    cin >> t;
    while(t--) solve();
    return 0;
}