#include <bits/stdc++.h>

using ll = long long;

constexpr int P = 998244353;

ll add(ll a, ll b) {
  ll res = a + b;
  return (res >= P ? res - P : res);
}

ll mul(ll a, ll b) {
  return a * b % P;
}

void solve() {
  std::multiset<int> set;
  int cur;
  for (int i = 1; i <= 9; i++) {
    if (i == 1) {
      std::cin >> cur;
    } else {
      int a;
      std::cin >> a;
      for (int j = 0; j < a; j++) {
        set.insert(i);
      }
    }
  }

  while (cur > 0 && !set.empty() && *set.begin() == 2) {
    int x = *set.begin();
    set.erase(set.begin());
    set.insert(x + 1);

    cur--;
  }

  int ans = 1;
  while (cur > 3) {
    ans = mul(ans, 3);
    cur -= 3;
  }
  if (cur == 1 && !set.empty()) {
    int x = *set.begin();
    set.erase(set.begin());
    set.insert(x + 1);
  }
  if (cur != 0) {
    ans = mul(ans, cur);
  }
  for (int x : set) {
    ans = mul(ans, x);
  }

  std::cout << ans << "\n";

}

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