#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int long long
const int N = 1e6 + 10;
const int M = 1e3 + 10;
const int mod = 2148473648;
int a[5];
void solve()
{
	for (int i = 1; i <= 4; i++)
		cin >> a[i];
	int ans1 = 1;
	int ans2 = 0;
	for (int i = 1; i <= 4; i++)
		ans1 = ans1 * (a[i] - 2);
	for (int i = 1; i <= 4; i++)
		for (int j = 1; j <= 4; j++)
		{
			for (int k = 1; k <= 4; k++)
				if (i != j && i != k && j != k)
					ans2 += (a[i] - 2) * (a[j] - 2) * (a[k] - 2);
		}
	ans2 /= 3;
	int ans3 = 0;
	for (int i = 1; i <= 4; i++)
		for (int j = 1; j <= 4; j++)
		{
			for (int k = 1; k <= 4; k++)
				for (int q = 1; q <= 4; q++)
					if (i != j && i != k && j != k && q != k && i != q && j != q)
						ans3 += (((a[i] - 2) + (a[j] - 2) + (a[k] - 2)) * (a[q] - 2));
		}
	ans3 /= 3;
	int ans4 = 1;
	int ans5 = 16;
	ans4 = (a[1] - 2 + a[2] - 2 + a[3] - 2 + a[4] - 2) * 8;

	cout << ans1 % mod << " " << ans2 % mod << " " << ans3 % mod << " " << ans4 % mod << " " << ans5 % mod << " "
		 << "0 0 0 0" << endl;
}

signed main()
{
	int t = 1;
	cin >> t;
	while (t--)
	{
		solve();
	}
	// system("pause");
	return 0;
}