#include <iostream>
#include <vector>

#define int long long

using namespace std;

const int mod=998244353;

int quick_pow(int base,int index)
{
	int ans=1,tmp=base;
	
	while(index){
		if(index&1){
			ans*=tmp;
			ans%=mod;
		}
		tmp*=tmp;
		tmp%=mod;
		index>>=1;
	}
	
	return ans;
}

int get_inv(int x)
{
	return quick_pow(x,mod-2);
}

void solve()
{
	vector<int> a(11);
	for(int i =1;i<=9;++i)
		cin>>a[i];
	
	int mx = min(a[1], a[2]);
	a[3] +=mx;
	a[1] -=mx;
	a[2] -=mx;
	
	if(a[1]){
		a[3] +=a[1]/3;
		a[1]%=3;
	}
	if(a[1] == 1){
		for(int i =2;i<=9;++i){
			if(a[i]){
				a[i]--;
				a[i + 1]++;
				break;
			}
		}
	}
	else if(a[1]==2)
		a[2]++;
		
	int ans  =1;
	for(int i =2;i<=10;++i)
		ans *= quick_pow(i,a[i]),ans%=mod;
	
	
	
	cout<<ans<<'\n';
	
	return;
}

signed main()
{
	int t;
	cin>>t;
	while(t--){
		solve();
	}
	
	return 0;
}