// Author: TrispdTit
// Date: 2024-11-14 18:33:18
//贪睡是一剂烈性毒品
#include <bits/stdc++.h>
#define endl '\n'
#define int long long
#define ll long long
using namespace std;

const int MOD = 998244353;

int add(int a, int b) {
    a += b;
    if(a >= MOD) a -= MOD;
    return a;
}

int mul(int a, int b) {
    return 1LL * a * b % MOD;
}

int sub(int a, int b) {
    a -= b;
    if(a < 0) a += MOD;
    return a;
}

int qpow(int base, int exp) {
    int res = 1;
    while(exp > 0) {
        if(exp & 1) res = mul(res, base);
        base = mul(base, base);
        exp >>= 1;
    }
    return res;
}

void solve() {
    int a[10] = {0};
    for(int i = 1; i <= 9; i++) {
        cin >> a[i];
    }

    if(a[1] < a[2]) {
        a[3] += a[1];
        a[2] -= a[1];
        a[1] = 0;
    } else {
        a[3] += a[2];
        a[1] -= a[2];
        a[2] = 0;
        a[3] += a[1] / 3;
        if(a[1] % 3 == 2) a[2]++;
        else if(a[1] % 3 == 1 && a[3] != 0) {
            a[4]++;
            a[3]--;
        }
        a[1] = 0;
    }

    int res = 1;
    for(int i = 1; i <= 9; i++) {
        if(a[i] != 0) {
            res = mul(res, qpow(i, a[i]));
        }
    }

    cout << res << "\n";
}

signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

    int t = 1;
    cin >> t;
    while(t--) {
       solve();
    }

    return 0;
}