//
// Created by 16373 on 2024/11/13.
//
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int mod=998244353;
int a[20];

void solve(){
    int n=9;
    memset(a,0,sizeof a);
    for(int i=1;i<=n;i++) cin>>a[i];
    if(a[2]>0){
        int now=min(a[2],a[1]);
        a[2]-=now;
        a[1]-=now;
        a[3]+=now;
    }
//    cout<<a[1]<<' '<<a[2]<<' '<<a[3]<<'\n';
    int cnt=a[1]/3;
    a[3]+=cnt;
    int now=a[1]%3;
    if(now==2) a[2]++;
    else if(now==1){
        for(int i=2;i<=n+5;i++){
            if(a[i]){
                a[i]--; a[i+1]++; now--;
                break;
            }
        }
    }
    int ans=1;
    for(int i=2;i<=n+5;i++){
        for(int j=0;j<a[i];j++){
            ans=ans*i%mod;
        }
    }
    cout<<ans<<'\n';

}
signed main(){
    ios::sync_with_stdio(0); cin.tie(0);
    int t;
    cin>>t;
    while(t--){
        solve();
    }
    return 0;
}
//2
//630
//3029 2336 377 41 10 61
//3000
//20000 10000 0 0 0 0