#include <algorithm>
#include <iostream>
#include <ranges>
#include <string>
#include <vector>
using ULL = unsigned long long;
int a[10], b[10];
int base_a, base_b;
std::vector<int> bnum;
ULL from_string0(const std::string &s)
{
    ULL res = 0;
    for (char c : s)
        res = res * base_a + a[c & 15] - 1;
    return res;
}
ULL from_string1(const std::string &s)
{
    ULL res = 0;
    ULL p = 1;
    for (int i = 1; i < s.size(); ++i)
        res += p *= base_a;
    return res + from_string0(s);
}
std::string to_string0(ULL x)
{
    std::string res;
    do
        res += '0' | bnum[x % base_b];
    while (x /= base_b);
    std::ranges::reverse(res);
    return res;
}
std::string to_string1(ULL x)
{
    ULL sum = 0;
    __int128 p = 1;
    int n = 1;
    while (!(x < sum + p * base_b))
        sum += p *= base_b, ++n;
    std::string res;
    while (n--)
    {
        res += '0' | bnum[x % base_b]; 
        x /= base_b;
    }
    std::ranges::reverse(res);
    return res;
}
void solve()
{
    for (int i = 0; i < 10; ++i)
        std::cin >> a[i];
    for (int i = 1; i < 10; ++i)
        a[i] += a[i - 1];
    base_a = a[9];
    bnum.clear();
    for (int i = 0; i < 10; ++i)
    {
        std::cin >> b[i];
        if (b[i]) bnum.push_back(i);
    }
    base_b = bnum.size();
    std::string s; std::cin >> s;
    ULL x = a[0] ? from_string0(s) : from_string1(s);
    // std::cout << x << "\n";
    std::cout << (b[0] ? to_string0(x) : to_string1(x)) << "\n";
}
int main()
{
    std::ios_base::sync_with_stdio(false), std::cin.tie(nullptr);
    int T; std::cin >> T;
    while (T--) solve();
}