#include <bits/stdc++.h>

using namespace std;

using i32 = int32_t;
using i64 = long long;
using ldb = long double;

#define int i64

using vi = vector<int>;
using pii = pair<int,int>;

const int mod = 998244353;


void solve() {
	vi a(10);
	for(int i = 1; i <= 9; i ++) cin >> a[i];
	
	vi res;
	ldb val = 0;
	
	for(int i = 0; i <= a[1]; i ++) {
		priority_queue<int,vi,greater<>> heap;
		for(int j = 0; j < i; j ++)
			heap.push(1);
		for(int j = 2; j <= 9; j ++) 
			for(int k = 0; k < a[j]; k ++)
				heap.push(j);
		if(heap.empty()) continue;
		
		
		int x = a[1] - i;
		while(x --) {
			int y = heap.top();
			heap.pop();
			heap.push(y + 1);
		}
		vi ret;
		ldb ans = 0;
		while(not heap.empty()) {
			ret.push_back((i64)heap.top()), ans += log((i64)heap.top());
			heap.pop();
		}
		if(ans > val) res = ret, val = ans;
	}
	int pi = 1;
	for(auto i : res)
		pi = pi * i % mod;
	cout << pi << "\n";
	return 	;
}

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