#include <iostream>
#include <map>
#include <set>
#include <array>
#include <cmath>
#include <queue>
#include <stack>
#include <bitset>
#include <random> //mt19937 mtrand(time(0));
#include <string>
#include <time.h>
#include <vector>
#include <cstring>
#include <iomanip> //fixed<<setprecision(12)<<
#include <utility> //pair模板,std::move()
#include <assert.h>
#include <algorithm>
#include <unordered_map>
#define QAQ 0
#define endl '\n'
#define close                         \
    std::ios::sync_with_stdio(false); \
    cin.tie(0);                       \
    cout.tie(0)
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
const db pi = acos(-1);
const db eps = 1e-7;
const int inf = 1e9;
const ll INF = 2e18;
const int N = 1e6 + 7;
const int M = 5e6 + 7;
const int mod = 998244353;
const int base = 131;
using namespace std;
//

int cnt[N];

int ksm(int a, int b)
{
    int res = 1;
    for (; b; b >>= 1, a = 1ll * a * a % mod)
        if (b & 1)
            res = 1ll * res * a % mod;
    return res;
}

void solve()
{
    //	freopen("data.in.txt","r",stdin);
    //	freopen("data.out.txt","w",stdout);
    for (int i = 1; i <= 9; i++)
    {
        cin >> cnt[i];
    }
    cnt[10] = 0;

    if (cnt[2] && cnt[1])
    {
        int d = min(cnt[2], cnt[1]);
        cnt[3] += d;
        cnt[1] -= d;
        cnt[2] -= d;
    }

    if (cnt[1] >= 3)
    {
        cnt[3] += cnt[1] / 3;
        cnt[1] %= 3;
    }

    if (cnt[1] == 1)
    {
        for (int i = 2; i <= 9; i++)
        {
            if (cnt[i])
            {
                cnt[i]--;
                cnt[i + 1]++;
                break;
            }
        }
    }
    else if (cnt[1] == 2)
    {
        cnt[1] = 0;
        cnt[2] += 1;
    }
    // for (int i = 1; i <= 10; i++)
    //     cout << cnt[i] << ' ';
    // cout << endl;

    int res = 1;
    for (int i = 2; i <= 10; i++)
        if (cnt[i])
            res = 1ll * res * ksm(i, cnt[i]) % mod;
    cout << res << endl;
}

signed main()
{
    close;
    int t = 1;
    cin >> t;
    while (t--)
    {
        solve();
    }
    return QAQ;
}