#include <bits/stdc++.h>
#include <iostream>

using namespace std;
#define int long long
const int mod = 998244353;

int qpow(int a, int b) {
  a %= mod;
  int res = 1;
  while (b) {
    if (b & 1) {
      res = (res * a) % mod;
    }
    a = (a * a) % mod;
    b >>= 1;
  }
  return res % mod;
}

const int N = 12;

int a[12], ans;

void solve() {
  memset(a, 0, sizeof(a));
  ans = 1;
  for (int i = 1; i <= 9; ++i)
    cin >> a[i];
  while (a[1] >= 2 && a[1] > a[2]) {
    a[1] -= 2, a[2]++;
  }
  for (int i = 2; i <= 9; ++i) {
    if (a[1] == 0)
      break;
    int ad = min(a[1], a[i]);
    a[1] -= ad, a[i] -= ad, a[i + 1] += ad;
  }
  for (int i = 1; i <= 10; ++i) {
    ans %= mod;
    if (a[i])
      ans *= (qpow(i, a[i])) % mod;
  }
  cout << ans << endl;
}

signed main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int t;
  cin >> t;
  while (t--)
    solve();
  return 0;
}