#include<bits/stdc++.h>
using namespace std;

#define V vector
#define pb push_back

typedef long long LL;

const int mod = 998244353;

void solve() {

    V<int> hav(11);

    for(int i = 1; i <= 9; i++) {
        cin >> hav[i];
    }

    int mn = min(hav[2], hav[1]);
    hav[2] -= mn, hav[1] -= mn;
    hav[3] += mn;

    int res = hav[1] / 3;
    hav[3] += res;

    hav[1] %= 3;
    if(hav[1] == 1) {
        bool find = 0;
        for(int i = 2; i <= 9; i++) {
            if(hav[i]) {
                find = 1;
                hav[i]--, hav[i + 1]++;
                break;
            }
        }
        if(!find) {
            cout << 1 << "\n";
            return;
        }
    } 
    else if(hav[1] == 2) {
        hav[2]++;
    }

    LL ans =1;
    for(int i = 2; i <= 10; i++) {
        for(int j = 1; j <= hav[i]; j++) {
            ans = ans * i % mod;
        }
    }
    cout << ans << "\n";
}

int main() {
    ios::sync_with_stdio(0), cin.tie(0);
    int t; cin >> t;
    while(t--)
        solve();
}