#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;i>=a;i--)
#define endl '\n'
#define ll long long
#define pb push_back

const int N=1e6+10;
const ll mod1=998244353ll;

//////////////////

ll a[100];

/////////////////


/////////////////

void init()
{

}

/////////////////

int main()
{
    ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
  //  freopen("ain.txt","r",stdin);freopen("aout.txt","w",stdout);

    int tt;
    cin>>tt;
    while (tt--)
    {
        priority_queue<ll,vector<ll > ,greater<ll>  > q;
        rep(i,1,9)
        {
            cin>>a[i];
        }

        ll ans=1;

        ll minn=min(a[1],a[2]);
        if(a[1]==a[2]+1)
        {
            minn--;
        }
        a[1]-=minn;
        a[2]-=minn;

        rep(i,1,minn)
        {
            ans*=3ll;
            ans%=mod1;
        }

        
        if(a[1]==1)
        {
            rep(i,2,9)
            {
                if(a[i])
                {
                    a[i]--;

                    ans*=1ll*i+1;
                    ans%=mod1;

                    a[1]=0;
                    break;
                }
            }
        }
        else 
        {
            if(a[1]%3==1)
            {
                a[1]-=4;
                ans*=4ll;
                ans%=mod1;
            }
            else if(a[1]%3==2)
            {
                a[1]-=2;
                ans*=2ll;
                ans%=mod1;
            }
            rep(i,1,a[1]/3)
            {
                ans*=3ll;
                ans%=mod1;
            }


        }

        rep(i,2,9)
        {
            rep(j,1,a[i])
            {
                ans*=1ll*i;
                ans%=mod1; 
            }
        }

        cout<<ans<<endl;
    
    }
    
    return 0;
}