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

#define fin(filename) freopen(#filename".in", "r", stdin)
#define fout(filename) freopen(#filename".out", "w", stdout)
#define file(filename) fin(filename), fout(filename)
#define _f(i, a, b) for (int i = a; i <= b; ++i)
#define _d(i, a, b) for (int i = a; i >= b; --i)
using pii = pair<int, int>;
using ll = long long;
#define fi first
#define se second
#define all(container) container.begin(), container.end()
#define dubug() cerr << __LINE__ << '\n';

bool Mbe;

static constexpr int N = 2e5 + 5, mod = 998244353;

int n, a[15], sum;
priority_queue<int, vector<int>, greater<int>> q;
inline int ksm(int x, int y = mod - 2) {
  int ret = 1;
  while(y) {
    if(y & 1) ret = 1ll * ret * x % mod;
    x = 1ll * x * x % mod, y >>= 1;
  }
  return ret;
}

void solve() {
  sum = 0;
  int ans = 1;
  a[10] = 0;
  _f(i, 1, 9) cin >> a[i], sum += a[i];
  while(a[1] >= 2) {
    while(a[2] >= 2 && a[1]) {
      a[1]--, a[2]--, a[3]++;
    }
    if(a[1] >= 2) a[1] -= 2, a[2]++;
  }
  bool flg = a[1];
  _f(i, 2, 10) {
    if(a[i] && flg) {
      a[i]--, flg = 0, a[i + 1]++;
    }
    ans = 1ll *ans*ksm(i, a[i]) % mod;
  }
  // if(a[1] == 0) {
  //   _f(i, 1, 9) ans = 1ll * ans * ksm(i, a[i]) % mod;
  // } else if(a[1] == 1) {
  //   if(sum == 1) ans = 1;
  //   else {
  //     _f(i, 2, 9) ans = 1ll * ans * ksm(i, a[i]) % mod;
  //     _f(i, 2, 9) if(a[i]) ans = 1ll * ans * ksm(i) % mod * (i + 1) % mod;
  //   }
  // } else {
  //   // a[1] -= 2, ++a[2];
  //   _f(i, 1, 9) _f(j, 1, a[i]) q.emplace(i);
  //   while(q.top() == 1) {
  //     q.pop();
  //     auto it = q.top();
  //     q.pop();
  //     q.emplace(it + 1);
  //   }
  //   // _f(i, 1, a[1]) {
  //   //   auto it = q.top(); q.pop(); q.emplace(it + 1);
  //   // }
  //   while(q.size()) ans = 1ll * ans * q.top() % mod, q.pop();
  // }
  cout << ans << '\n';
}

bool Med;

signed main() {
    cerr << setprecision(3) << fixed << (&Mbe - &Med) / 1048576.0 << " MB\n";
    ios::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    int tt; cin >> tt;
    while(tt--) solve();
    cerr << 1e3 * clock() / CLOCKS_PER_SEC << " ms\n";
    return 0;
}

// by zzzcr.