#include <bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
#define mkp make_pair
#define pb push_back
typedef pair <int, int> pii;

inline int read() {
	int x = 0, f = 0;
	char c = getchar();
	while (!isdigit(c)) {if (c == '-') f = 1; c = getchar();}
	while (isdigit(c)) x = (x << 1) + (x << 3) + (c & 15), c = getchar();
	return f? -x : x;
}

//const int MAXN = 1e6;
const int Mod = 2148473648;
int f[10], C[10][10];
signed main() {
//	freopen ("std.in", "r", stdin);
//	freopen ("std.out", "w", stdout);
	int T = read(); C[0][0] = 1;
	for (int i = 1; i <= 4; ++i) {
		C[i][0] = 1;
		for (int j = 1; j <= 4; ++j)
			C[i][j] = (C[i - 1][j] + C[i - 1][j - 1]) % Mod;
	}
	while (T--) {
		int R[4];
		R[0] = read(), R[1] = read(), R[2] = read(), R[3] = read();
		memset(f, 0, sizeof(f));
		for (int i = 0; i < 16; ++i) {
			int cnt = 1, ff = 0;
			for (int j = 0; j < 4; ++j) {
				if (R[j] == 1) ++ff;
				if (i >> j & 1) cnt = cnt * min(2ll, R[j]) % Mod, ++ff;
				else cnt = cnt * max(0ll, R[j] - 2) % Mod;
			}
	//		if (ff == 4 && cnt) {
	//			cerr << "fuck" << endl;
	//		}
			(f[ff] += cnt) %= Mod;
		}
		for (int i = 0; i < 9; ++i)
			printf("%lld ", f[i]);
		printf("\n");
	}
	return 0;
}