#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for(int i=a;i<n;++i)
#define per(i,a,n) for(int i=n-1;i>=a;--i)
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define endl '\n'
#define SZ(x) ((ll)(x).size())
typedef vector<int> vi;
typedef vector<long long> vl;
typedef long long ll;
typedef pair<int,int> pii;
typedef double db;
mt19937 mrand(random_device{}());
int rnd(int x){return mrand()%x;}
const ll mod=998244353;

ll powmod(ll a,ll b,ll p=mod) {
	ll res=1,t=a;
	while (b) {
		if (b&1) res=res*t%p;
		t=t*t%p;
		b>>=1;
	}
	return res;
}

signed main() {
	int tc;
	scanf("%d",&tc);
	while (tc--) {
		vi vi_a(15);
		rep(i,0,9) scanf("%d",&vi_a[i]);
		int i_tmp=vi_a[0]+2*vi_a[1];
		vi_a[0]=vi_a[1]=0;
		vi_a[2]+=i_tmp/3,i_tmp%=3;
		if (i_tmp==2) {
			vi_a[1]=1;
			i_tmp=0;
		}
		rep(i,2,9) {
			if (!i_tmp) break;
			else {
				int disc=min(vi_a[i],i_tmp);
				vi_a[i]-=disc;
				vi_a[i+1]+=disc;
				i_tmp-=disc;
			}
		}
		ll ans=0;
		rep(i,0,15) {
			// cerr<<vi_a[i]<<endl;
			if (!ans) ans=powmod(i+1,vi_a[i]);
			else ans*=powmod(i+1,vi_a[i]),ans%=mod;
		}
		cout<<ans<<endl;
	}
}