#include<cstdio>
const int mod=998244353;
int a[11];
#include<queue>
std::priority_queue<int>q;
int main(){
    // freopen("a.in","r",stdin);
    int t;
    scanf("%d",&t);
    while(t--){
        for(int i=1;i<=9;i++)scanf("%d",a+i);
        int flag=0;
        for(int i=2;i<=a[1];i+=2){
            if(a[2]>=2){
                a[3]+=2,a[2]-=2;
            }
            else {
                a[2]++;
            }
        }
        if(a[1]&1){
            for(int i=2;i<=9;i++)if(a[i]){
                a[i]--,a[i+1]++;
                break;
            }
        }
        int ans=1;
        for(int i=2;i<=9;i++){
            for(int j=1;j<=a[i];j++)ans=1ll*ans*i%mod;
        }
        printf("%d\n",ans);
    }
    return 0;
}