// #pragma GCC optimize(2)
// #pragma GCC optimize(3,"Ofast","inline")
#include <bits/stdc++.h>
using namespace std;
#define x first
#define y second
#define int long long
#define endl '\n'
using i128 = __int128;
using i64 = long long;
using f128 = long double;
using u64 = unsigned long long;
using pii = pair<int, int>;
const int INF = 0x3f3f3f3f, mod = 998244353;
const i64 inf = 2e18;
//-------------------------------------------

int qmi(int x, int k) // 快速幂
{
  int res = 1;
  while (k)
  {
    if (k & 1)
      res = res * x % mod;
    x = x * x % mod;
    k >>= 1;
  }
  return res;
}

void solve()
{
  vector<int> cnt(15);

  for (int i = 1; i <= 9; i++)
  {
    cin >> cnt[i];
  }

  int ans = 1;
  int w = min (cnt[2],cnt[1]);
  cnt[3] += w;
  cnt[2] -= w;
  cnt[1] -= w;
  cnt[3] += cnt[1] / 3;
  cnt[1] %= 3;
  if (cnt[1] == 2)
  {
    cnt[2]++;
  }
  else if (cnt[1] == 1)
  {
    for (int i = 2; i <= 9; i++)
    {
      if (cnt[i] > 0)
      {
        cnt[i]--;
        cnt[i + 1]++;
        break;
      }
    }
  }

  for (int i = 2; i <= 10; i++)
  {
    ans = ans * qmi(i, cnt[i]) % mod;
    //cerr << i << " " << cnt[i] << endl;
  }
  cout << ans % mod << endl;
}

signed main()
{
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);
  int T = 1;
  cin >> T;
  for (int i = 1; i <= T; i++)
    solve();
  return 0;
}