#include <bits/stdc++.h>
#define lowbit(x) (x & -x)
#define int long long
#define lc (p << 1)
#define rc (p << 1 | 1)
using namespace std;
typedef pair<int, int> PII;
mt19937_64 rnd(chrono::steady_clock::now().time_since_epoch().count());
const int N = 2e5 + 5, M = 1e6 + 5, INF = 0x3f3f3f3f, mod = 998244353;

int T = 1, n, m, a[N];

int calc(int x) {
	int res = 1;
	while(x) res *= 3, x--;
	return res;
}

int get(int x) {
	if (x % 3 == 0) return calc(x / 3);
	else if(x % 3 == 1) {
		if (x == 1) return 1;
		else return 4 * calc((x - 4) / 3);
	} else return 2 * calc(x / 3);
}

void solve() {
	
	bool sig = false;
	multiset<int>st;
	
	for (int i = 1; i <= 9; i++) {
		cin >> a[i];
		if (a[i]) sig = true;
		for (int j = 1; j <= a[i] && i > 1; j++)
			st.insert(i);
	}
	
	while(a[1] && st.size()) {
		
		int x = *st.begin();
		
		if (get(a[1]) * x <= get(a[1] - 1) * (x + 1)) {
			a[1]--;
			st.erase(st.begin());
			st.insert(++x);
		} else break;
	}

	int ans = get(a[1]);
	if (sig) ans = max(ans, 1ll);
	ans %= mod;
	
	for (auto & x: st) ans = ans * x % mod;
	
	cout << ans << endl;
}
signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> T;
	while (T--) solve();
}