#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<bitset>
#include<cmath>
#include<ctime>
#include<queue>
#include<map>
#include<set>

#define int long long
#define fi first
#define se second
#define max Max
#define min Min
#define abs Abs
#define lc (x<<1)
#define rc (x<<1|1)
#define mid ((l+r)>>1)
#define pb(x) push_back(x)
#define lowbit(x) (x&(-x))
#define fan(x) (((x-1)^1)+1)
#define mp(x,y) make_pair(x,y)
#define clr(f,n) memset(f,0,sizeof(int)*(n))
#define cpy(f,g,n) memcpy(f,g,sizeof(int)*(n))
#define INF 0x3f3f3f3f

using namespace std;

inline int read()
{
	int ans=0,f=1;
	char c=getchar();
	while(c>'9'||c<'0'){if(c=='-')f=-1;c=getchar();}
	while(c>='0'&&c<='9'){ans=(ans<<1)+(ans<<3)+c-'0';c=getchar();}
	return ans*f;
}

inline void write(int x)
{
	if(x<0) putchar('-'),x=-x;
	if(x/10) write(x/10);
	putchar((char)(x%10)+'0');
}

template<typename T>inline T Abs(T a){return a>0?a:-a;};
template<typename T,typename TT>inline T Min(T a,TT b){return a<b?a:b;}
template<typename T,typename TT> inline T Max(T a,TT b){return a<b?b:a;}

const int mod=2148473648;
int t,n=4,a[10],dp[10][10];

signed main()
{
	t=read();
	while(t--)
	{
		memset(dp,0,sizeof(dp));
		for(int i=1;i<=n;++i)
			a[i]=read();
		dp[0][0]=1;
		for(int i=1;i<=n;++i)
			if(a[i]==1)
			{
				for(int j=0;j<=n*2;++j)
					dp[i][j+2]=(dp[i][j+2]+dp[i-1][j])%mod;
			}
			else
			{
				for(int j=0;j<=n*2;++j)
				{
					dp[i][j]=(dp[i][j]+dp[i-1][j]*(a[i]-2))%mod;
					dp[i][j+1]=(dp[i][j+1]+dp[i-1][j]*2)%mod;
				}
			}
		for(int i=0;i<=n*2;++i)
			write(dp[n][i]),putchar(' ');
		puts("");
	}
	return 0;
}