#include <bits/stdc++.h>

long long mod = 2148473647ll;

int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	std::cout.tie(nullptr);
	int T;
	std::cin >> T;
	static long long f[4], tot[10];
	auto dfs = [&](auto &self, long long cur, int k, int cnt) -> void {
		if (k == 4) {
			tot[cnt] += cur;
			tot[cnt] %= mod;
		}
		else {
			if (f[k] == 1) {
				self(self, cur, k + 2, cnt);
			}
			else {
				self(self, cur * (f[k] - 2) % mod, k + 1, cnt);
				self(self, cur * 2 % mod, k + 1, cnt + 1);
			}
		}
	};	
	while (T--) {
		for (int i = 0; i < 4; ++i)
			std::cin >> f[i];
		memset(tot, 0, sizeof tot);
		dfs(dfs, 1, 0, 0);
		for (int i = 0; i < 9; ++i)
			std::cout << tot[i] << " ";
		std::cout << '\n';
	}
	return 0;
}