#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int,int>pii;
typedef pair<ll,ll>pll;
typedef pair<ld,ld>pdd;
typedef pair<ll, pair<ll, ll> > plpair;
typedef vector<int> vi;
typedef vector<ll> vl;
#define endl '\n'
#define rep(i, a, b) for (ll i = (a); i <= (b); ++i)
#define per(i, a, b) for(ll i = (a); i >= (b); --i)
#define debug(x) cout<<#x<<": "<<x<<endl
#define lowbit(id) id & (-id)
#define fi first
#define sec second
#define lc id<<1
#define rc id<<1|1
#define sz(x) (int)(x).size()
#define all(t) (t).begin(), (t).end()
#define meh {cout<<"NO"<<endl;return;}
#define yay {cout<<"YES"<<endl;return;}
#define vin(v) for(auto&x:v)cin>>x;
#define print(v) for (auto x: v)cout<<x<<' ';cout<<endl;
#define sqrt(x) sqrtl(x)
mt19937_64 rnd(chrono::steady_clock::now().time_since_epoch().count());
const ll N = 10;
const ll mod = 2148473648;

void solve() {
    ll a[5];
    cin >> a[1] >> a[2] >> a[3] >> a[4];
    ll s0 = 1;
    rep(i, 1, 4) {
        s0 *= max(0ll, (a[i] - 2));
        s0 %= mod;
    }
    ll s1 = 0;
    rep(i, 1, 4) {
        rep(j, i + 1, 4) {
            rep(k, j + 1, 4) {
                s1 += max(0ll, a[i] - 2) * max(0ll, a[j] - 2) % mod * max(0ll, a[k] - 2) % mod * 2 % mod;
                s1 %= mod;
            }
        }
    }
    ll s2 = 0;
    rep(i, 1, 4) {
        rep(j, i + 1, 4) {
            s2 += max(0ll, a[i] - 2) * max(0ll, a[j] - 2) % mod;
            s2 %= mod;
        }
    }
    s2 *= 4;
    s2 %= mod;
    ll s3 = 0;
    rep(i, 1, 4) {
        s3 += max(0ll, a[i] - 2) * 8 % mod;
        s3 %= mod;
    }
    ll s4 = 16;
    rep(i, 1, 4) {
        if(a[i] == 1) {
            s4 /= 2;
        }
    }
    if(s4 == 1) s4 = 0;
    cout << s0 << ' ' << s1 << ' ' << s2 << ' ' << s3 << ' ' << s4 << ' ' << 0 << ' ' << 0 << ' ' << 0 << ' ' << 0 << endl;
}

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0),cout.tie(0);
//     freopen("test.in","r",stdin);
//     freopen("test.out","w",stdout);
	int T=1;
	cin>>T;
	while(T--)
	{
		solve();
	}
	return 0;
}