#include <bits/stdc++.h>
using namespace std;
#define max_len 100010
#define mod_n 998244353
#define int int64_t

double log_arr[] = {0, 0, 1, log2(3), 2, log2(5), log2(6), log2(7), 3, log2(9), log2(10)};

struct numb
{
    int modn;
    double logn;
    bool operator<(const numb& r) const
    {
        return logn < r.logn;
    }
};
#define mod(xx) ((xx) % mod_n)
int qpow(int x, int n)
{
    if(n == 0) return 1;
    else if(n == 1) return mod(x);
    else if(n % 2 == 0) return qpow(mod(x * x), n / 2);
    else return mod(x * qpow(mod(x * x), n / 2));
}

numb get_ans(vector<int> varr)
{
    numb ans;
    int mv_a = varr[1];
    varr[1] = 0;
    for (int i = 2; i <= 9; i++)
    {
        int mv_cnt = 0;
        if(mv_a > varr[i])
        {
            mv_a -= varr[i];
            mv_cnt = varr[i];
        }
        else
        {
            mv_cnt = mv_a;
            mv_a = 0;
        }
        varr[i + 1] += mv_cnt;
        varr[i] -= mv_cnt;
    }
    ans.modn = 1;
    for (int i = 2; i <= 10; i++)
    {
        ans.modn *= qpow(i, varr[i]);
        ans.modn = mod(ans.modn);
    }
    ans.logn = 0;

    for (int i = 2; i <= 10; i++)
    {
        ans.logn += log_arr[i] * varr[i];
    }
    return ans;
}


void sol()
{
    vector<int> vec(12, 0);
    for (int i = 1; i <= 9; i++)
    {
        cin >> vec[i];
    }
    vector<numb> ansv;
    for (; vec[1] >= 0; )
    {
        ansv.push_back(get_ans(vec));
        vec[1] -= 2;
        vec[2]++;
    }
    sort(ansv.begin(), ansv.end());
    cout << ansv.back().modn << "\n";
    
}
int32_t main()
{
    int T;
    cin >> T;
    while (T--)
    {
        sol();
    }
    
    
}