#include <bits/stdc++.h>
#define all(x) begin(x), end(x)
#define rep(i, l, r) for (int i = (l), i##end = (r); i <= i##end; ++i)
#define per(i, l, r) for (int i = (l), i##end = (r); i >= i##end; --i)
#ifdef memset0
#define log(...) fprintf(stderr, __VA_ARGS__)
#else
#define log(...) (void(0))
#define endl '\n'
#endif
using namespace std;
using ll = long long;
using lf = long double;
using ull = unsigned long long;
using LL = __int128;
const int L = 70;
int T, s1[15], rk1[15], sz1, s2[15], a2[15], sz2;
string str;
LL Enc(int *s, int *a, int n, string t) {
  LL ret = 0;
  if (s[0]) {
    LL pw = 1;
    for (int i = t.size() - 1; i >= 0; --i) ret += pw * a[t[i] - '0'], pw *= n;
  } else {
    LL pw = 1;
    for (int i = 1; i < t.size(); ++i) pw *= n, ret += pw;
    // cerr << "RET=" << (ull)ret << "\n";
    pw = 1;
    for (int i = t.size() - 1; i >= 0; --i) ret += pw * a[t[i] - '0'], pw *= n;
  }
  // cerr << "RET=" << (ull)ret << "\n";
  return ret;
}
int tmp[L + 10], sz;
string Dec(int *s, int *a, int n, LL rk) {
  if (s[0]) {
    while (rk) tmp[++sz] = rk % n, rk /= n;
  } else {
    LL pw = n;
    while (rk > pw) rk -= pw, ++sz, pw *= n;
    for (int i = 1; i <= sz; ++i) tmp[i] = rk % n, rk /= n;
  }
  string ret = "";
  for (int i = sz; i >= 1; --i) ret += a[tmp[i]] + '0';
  return ret;
}
int main() {
#ifdef memset0
  freopen("G.in", "r", stdin);
#endif
  cin.tie(0)->sync_with_stdio(0);
  cin >> T;
  while (T--) {
    sz = 0;
    sz1 = sz2 = 0;
    for (int i = 0; i <= 9; ++i) {
      cin >> s1[i];
      if (s1[i]) rk1[i] = (sz1++);
    }
    for (int i = 0; i <= 9; ++i) {
      cin >> s2[i];
      if (s2[i]) a2[sz2++] = i;
    }
    cin >> str;
    cout << Dec(s2, a2, sz2, Enc(s1, rk1, sz1, str)) << "\n";
  }
}