#include<bits/stdc++.h>
using namespace std;
using i64 = int64_t;
using i128 = __int128_t;

constexpr int N = 10;

void solve() {
    vector<int> a(N);
    for (auto& x : a) {
        cin >> x;
    }
    vector<int> b(N);
    for (auto& x : b) {
        cin >> x;
    }
    vector<char> pos(N); 
    for (int i = 1; i < N; i++) {
        a[i] += a[i - 1];
        b[i] += b[i - 1];
        if (b[i] != b[i - 1]) {
            pos[b[i] - 1] = i + '0';
        }
    }

    if (pos[0] == 0) {
        pos[0] = '0';
    }

    auto eval = [&](string s) -> i128 {
        i128 ans = 0;
        for (auto& x : s) {
            ans = ans * a[N - 1] + (a[x - '0'] - 1);
        }
        return ans;
    };

    auto tran = [&](i128 x) -> string {
        if (x == 0) {
            return string(1, pos[0]);
        }
        string t;
        while (x > 0) {
            t += pos[x % b[N - 1]];
            x /= b[N - 1];
        } 
        reverse(t.begin(), t.end());
        return t;
    };

    string s;
    cin >> s;
    cout << tran(eval(s)) << "\n";
}

/*
1
1 0 1 0 0 0 0 0 0 0
1 1 0 0 0 0 0 0 0 0
20
*/

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

    int T = 1;
    cin >> T;
    while (T--) {
        solve();
    }

    return 0;
}