#include <bits/stdc++.h>
#define min(a,b) (a > b ? b : a)
#define max(a,b) (a < b ? b : a)

#define YES (cout << "YES" << endl)
#define NO (cout << "NO" << endl)
#define all(x) (x).begin(), (x).end()
#define endl '\n'
#define mem(a,b) memset(a,b,sizeof(a))
#define rrep(a, b, c) for (a = b; a >= c; a--)
#define rep(a, b, c) for (a = b; a <= c; a++)
#define int long long
#define IOS ios::sync_with_stdio(0); cout.tie(0);

using namespace std;

typedef double db;
typedef pair<int,int> pii;
typedef array <int,3> a3;

const db eps = 1e-7;
const int inf = 0x3f3f3f3f3f3f3f3f;
const int N = 200010;

template<long long mod>
struct mint{
    long long qmi(long long a,long long b){
        long long res = 1;
        while (b){
            if (b & 1) res = (res * a) % mod;
            a = (a * a) % mod;
            b >>= 1;
        }
        return res;
    }
    long long inv(long long x){
        return qmi(x,mod-2);
    }
    long long val;
    mint(long long val_) : val(val_ % mod) { }
    mint(signed val_) : val(val_ % mod) { }
    mint() { val = 0;}
    mint operator+(const mint &t){
        return mint((t.val + val) % mod);
    }
    mint operator-(const mint &t){
        return mint((val - t.val + mod) % mod);
    }
    mint operator*(const mint &t){
        return mint((val * t.val) % mod);
    }
    mint operator/(const mint &t){
        return mint((val * (inv(t.val))) % mod);
    }
    void operator+=(const mint &t){
        val = (val + t.val) % mod;
    }
    void operator-=(const mint &t){
        val = (val - t.val + mod) % mod;
    }
    void operator*=(const mint &t){
        val = (val * t.val) % mod;
    }
    void operator/=(const mint &t){
        val = (val * inv(t.val)) % mod;
    }
    mint operator+(long long t){
        t = ((t % mod) + mod) % mod;
        return mint((t + val) % mod);
    }
    mint operator-(long long t){
        t = ((t % mod) + mod) % mod;
        return mint((val - t + mod) % mod);
    }
    mint operator*(long long t){
        t = ((t % mod) + mod) % mod;
        return mint((val * t) % mod);
    }
    mint operator/(long long t){
        t = ((t % mod) + mod) % mod;
        return mint((val * (inv(t))) % mod);
    }
    void operator+=(long long t){
        t = ((t % mod) + mod) % mod;
        val = (val + t) % mod;
    }
    void operator-=(long long t){
        t = ((t % mod) + mod) % mod;
        val = (val - t + mod) % mod;
    }
    void operator*=(long long t){
        t = ((t % mod) + mod) % mod;
        val = (val * t) % mod;
    }
    void operator/=(long long t){
        t = ((t % mod) + mod) % mod;
        val = (val * inv(t)) % mod;
    }
    mint operator+(signed t){
        t = ((t % mod) + mod) % mod;
        return mint((t + val) % mod);
    }
    mint operator-(signed t){
        t = ((t % mod) + mod) % mod;
        return mint((val - t + mod) % mod);
    }
    mint operator*(signed t){
        t = ((t % mod) + mod) % mod;
        return mint((val * t) % mod);
    }
    mint operator/(signed t){
        t = ((t % mod) + mod) % mod;
        return mint((val * (inv(t))) % mod);
    }
    void operator+=(signed t){
        t = ((t % mod) + mod) % mod;
        val = (val + t) % mod;
    }
    void operator-=(signed t){
        t = ((t % mod) + mod) % mod;
        val = (val - t + mod) % mod;
    }
    void operator*=(signed t){
        t = ((t % mod) + mod) % mod;
        val = (val * t) % mod;
    }
    void operator/=(signed t){
        t = ((t % mod) + mod) % mod;
        val = (val * inv(t)) % mod;
    }
    void operator=(const int &x){
        val = ((x % mod) + mod) % mod;
    }
    friend std::ostream &operator<<(std::ostream &os, mint a) {
        a.val = ((a.val % mod) + mod) % mod;
        return os << a.val;
    }
};
typedef mint<998244353> Mint;

void solve(){
    int n = 9;

    int i, j;

    vector <int> c(15);
    rep(i,1,n) cin >> c[i];

    Mint ans = 1;
    Mint qmi = 0;
    int res = 0;

    int cost = min(c[1], c[2]);

    c[1] -= cost;
    c[2] -= cost;
    c[3] += cost;

    c[3] += c[1] / 3;
    c[1] %= 3;

    c[2] += c[1] / 2;
    c[1] %= 2;

    bool isok = 0;

    rep(i,2,9){
        if (c[i]){
            c[i] -= c[1];
            c[i + 1] += c[1];
            c[1] = 0;
            isok = 1;
            break;
        }
    }

    // cout << "ANS : ";

    if (!isok){
        if (c[1]) cout << 1 << endl;
        else cout << 0 << endl;
        return;
    }

    rep(i,2,n + 1){
        ans *= qmi.qmi(i, c[i]);
    }

    // rep(i,1,n + 1){
    //     cout << c[i] << ' ';
    // }   
    // cout << endl;

    cout << ans << endl;
}

/*


100

2 2 2 0 0 0 0 0 0 
1 0 0 0 0 0 0 0 0 
2 0 0 0 0 0 0 0 0 
2 1 0 0 0 0 0 0 0 
0 0 0 0 0 0 0 0 0 


5 3 0 0 0 0 0 0 0
4 1 1 1 0 0 0 0 0
1 0 0 0 0 0 0 0 0
1 0 0 0 0 0 0 0 1
1 0 0 0 0 0 0 0 2
99 88 77 66 55 44 33 22 11
100 90 80 70 60 50 40 30 20


*/

signed main(){
    cin.tie(0);
    IOS;

    int T = 1;
    cin >> T;

    while (T --){
        solve();
    }

    // system("pause");
}