#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 998244353;
void solve(){
  vector<ll> a(10);
  priority_queue<ll, vector<ll>, greater<ll>> pq;
  for(ll i = 1; i <= 9; ++i){
    cin >> a[i];
    if(i != 1){
      for(ll j = 1; j <= a[i]; ++j){
        pq.push(i);
      }
    }
  }
  auto get_val = [](priority_queue<ll, vector<ll>, greater<ll>> pq) -> ll {
    ll ans = 1;
    while(!pq.empty()){
      ans *= pq.top();
      ans %= mod;
      pq.pop();
    }
    return ans;
  };
  if(pq.empty()){
    int cur = ceil(double(a[1]) / 3.0);
    int two = 3 * cur - a[1];
    int th = (a[1] - two * 2) / 3;
    for(int i = 1; i <= two; ++i){
      pq.push(2);
    }
    for(int i = 1; i <= th; ++i){
      pq.push(3);
    }
    cout << get_val(pq) << '\n';
    return;
  }
  while(pq.top() <= 2 && a[1] >= 0){
    pq.pop();
    pq.push(3);
    a[1]--;
  }
  if(a[1] == 1){
    pq.push(pq.top() + 1);
    pq.pop();
  }
  else{
    int cur = ceil(double(a[1]) / 3.0);
    int two = 3 * cur - a[1];
    int th = (a[1] - two * 2) / 3;
    for(int i = 1; i <= two; ++i){
      pq.push(2);
    }
    for(int i = 1; i <= th; ++i){
      pq.push(3);
    }
  }
  cout << get_val(pq) << '\n';
}

int main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);
  ll t = 1;
  cin >> t;
  while(t--){
    solve();
  }
}