#include<bits/stdc++.h>
#define int long long
#define endl '\n'
#define vi vector<int>
#define vll vector<long long>
#define double long double
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<'*'<<x<<'\n';
#define yes cout<<"YES\n";
#define no cout<<"NO\n";
#define rep(x, y) for(int i=(x); i<=(y); i++)
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
const int INF=0x3f3f3f3f;
const ll LINF=0x3f3f3f3f3f3f3f3f;
const int mod=998244353;
ll gcd(ll a,ll b)
{
	return b?gcd(b,a%b):a;
}
ll lcm(ll a,ll b)
{
	return a*b/gcd(a,b);
}
ll qmi(ll a,ll b)
{
	ll ans=1;
	while(b)
	{
		if(b&1)ans=ans*a%mod;
		a=a*a%mod;
		b>>=1;
	}
	return ans;
}




void solve()
{
	vi arr(10), res;
	rep(1, 9)cin >> arr[i];
	double Max = 0;
	rep(0, arr[1])
	{
		double lans = 0;
		vi now;
		priority_queue<int, vector<int>, greater<int>>q;
		for(int j = 1; j <= 9; j++)
		{
			int n = arr[j];
			if(j == 1)n = i;
			for(int k = 1; k <= n; k++)q.push(j);
		}
		int x = arr[1] - i;
		while(q.size() && x --)
		{
			int t = q.top();
			q.pop();
			q.push(t+1);
		}
		while(q.size())
		{
			now.pb(q.top());
			lans += log(q.top());
			q.pop();
		}
		if(lans > Max)
		{
			Max = lans;
			res = now;
		}
	}
	int answer = 1;
	for(auto x : res)answer = answer * x % mod;
	cout << answer << endl;
}



signed main()
{
	ios::sync_with_stdio(0);
	cin.tie(0),cout.tie(0);
	int _;
	_=1;
	cin>>_;
	while(_--)solve();
	return 0;
}