#include <bits/stdc++.h>
//#define int long long
#define ll long long
#define db double
#define fi first
#define se second
#define pii pair<int,int>
#define vi vector<int>

using namespace std;
const ll mod=2148473648; 
long long a[5];
long long f[8][10]; 
int main() {
	int T;
	scanf("%d",&T);
	while (T--) {
		for (int i=1;i<=4;i++) {
			scanf("%lld",&a[i]); 
		}
		memset(f,0,sizeof(f)); 
		f[0][0]=1; 
		
		for (int i=1;i<=4;i++) {
			for (int j=0;j<=8;j++) {
				if (a[i]==1) {
					if (j>=2)
						f[i][j]+=f[i-1][j-2],f[i][j]%=mod; 
				}
				else {if (j>=1) 
					f[i][j]+=f[i-1][j-1]+f[i-1][j-1]; f[i][j]%=mod;
					
					f[i][j]+=f[i-1][j]*(a[i]-2)%mod; f[i][j]%=mod;  
				}
			}
		}
		for (int i=0;i<=8;i++) cout<<f[4][i]%mod<<' ';
		cout<<'\n'; 
	}
	return 0;
}