#include <bits/stdc++.h>
#define rep(i, a, b) for(int i = (a); i <= int(b); i ++)
#define per(i, a, b) for(int i = (a); i >= int(b); i --)
#define fi first
#define se second
#define all(s) s.begin(), s.end()
#define trv(i, u, v) for(int i = head[u], v = e[i].to; i; v = e[i = e[i].nxt].to)
#define sz(s) (int)(s.size())
#define lb(s) ((s) & (-s))
#define mk make_pair
#define pb push_back
using namespace std;

typedef __int128 u64;
typedef long long ll;
typedef pair<int,int> P;

template <typename T> bool chkmx(T &x, T y){return x < y ? x = y, true : false;}
template <typename T> bool chkmn(T &x, T y){return x > y ? x = y, true : false;}
template <int T> using A = array<int, T>;
inline u64 read() {
	u64 x = 0, f = 1; char c = getchar();
	for(; !isdigit(c); c = getchar()) if(c == '-')  f = 0;
	for(; isdigit(c); c = getchar()) x = x * 10 + c - '0';
	return f ? x : -x;
}
const int maxn = 20;
const u64 mod = 2148473648ll;
u64 a[maxn + 5], f[maxn + 5], g[maxn + 5];
int n;
void solve() {
	n = 4;
	rep(i, 1, n) a[i] = read();
	memset(f, 0, sizeof f); 
	f[0] = 1;
	rep(i, 1, n) {
		swap(f, g);
		memset(f, 0, sizeof f);
		u64 x = a[i] == 1 ? 0 : (a[i] - 2), y = 2 - (a[i] == 1);
		rep(j, 0, 2 * i) {
			f[j] = (g[j] * x % mod + (j - 1- (a[i] == 1) >= 0 ? g[j - 1 - (a[i] == 1)] : 0) * y % mod) % mod;
		}
	}
	rep(i, 0, 8) cout << (ll)f[i] << " \n"[i == 8];
}
int main() {
//	freopen("in.txt", "r", stdin);
	for(int T = read(); T; T --) {
		solve();
	}
	return 0;
}