#include<bits/stdc++.h>
using namespace std;
#define ri int
typedef long long ll;
const int maxn=1e5+10;
template<class T>inline bool ckmin(T &x,const T &y){return x>y?x=y,1:0;}
template<class T>inline bool ckmax(T &x,const T &y){return x<y?x=y,1:0;}
template<class T>inline void clear(T *arr,int siz,int val=0){memset(arr,val,sizeof(T)*(siz+1));}
const ll mod=2148473648;
int a[4];
ll ans[9];
void dfs(int p,int cnt,ll sum){
	if(p==4){
		(ans[cnt]+=sum)%=mod;
		return;
	}
	if(a[p]==1)dfs(p+1,cnt+2,sum);
	else dfs(p+1,cnt,sum*(a[p]-2)%mod),dfs(p+1,cnt+1,sum*2%mod);
}
int t_case;
int main(){
	scanf("%d",&t_case);
	while(t_case--){
		scanf("%d%d%d%d",a,a+1,a+2,a+3);
		clear(ans,8);
		dfs(0,0,1);
		for(ri i=0;i<9;++i)printf("%lld ",ans[i]);
		printf("\n");
	}
}