#include <iostream>

#define int long long

using namespace std;

const int mod=998244353;

int a[10];

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()
{
	int ans=1,mini=10;
	
	for(int i=1;i<=9;i++){
		cin>>a[i];
		if(a[i] && i>2) mini=min(mini,i);
		
		if(i>2) ans*=quick_pow(i,a[i]),ans%=mod;
	}
	
	if(a[2]<=a[1])
	{
		ans*=quick_pow(3,a[2]),ans%=mod;
		a[1]-=a[2];
		if(a[2]) mini=min(mini,3ll);
		
		while(a[1]>=3){
			ans*=3;
			ans%=mod;
			
			a[1]-=3;
			mini=min(mini,3ll);
		}
		if(a[1]==1) ans=(ans==1)?1:ans*get_inv(mini)*(mini+1),ans%=mod;
		else if(a[1]==2) ans*=2,ans%=mod;
	}
	else
	{
		ans*=quick_pow(3,a[2]),ans%=mod;
		a[2]-=a[1];
		
		ans*=quick_pow(2,a[2]),ans%=mod;
	}
	
	cout<<ans<<'\n';
	
	return;
}

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