#include<bits/stdc++.h>
#define em surnum(0) //inf
#define zer surnum(1) //0
#define on surnum(2) //1
#define mon surnum(3) //-1
#define hal surnum(4) //1/2
#define mhal surnum(5) //-1/2
#define upp surnum(6) //up
#define dow surnum(7) //down
#define str surnum(8) //star
#define mod 998244353
#define MX 1000000000
using namespace std;
struct surnum{
	int zz;
	bool operator==(const surnum &other)const{
		return zz==other.zz;
	}
	surnum(int zz=0):zz(zz){}
}f[250];
surnum operator+(surnum a,surnum b){
	if(a==em&&b==em)return zer;
	if(a==em&&b==zer)return mon;
	if(a==em&&b==on)return zer;
	if(a==em&&b==hal)return zer;
	if(a==em&&b==mhal)return mon;
	if(a==em&&b==upp)return zer;
	if(a==em&&b==dow)return mon;
	if(a==em&&b==str)return zer;
	if(a==zer&&b==em)return on;
	if(a==zer&&b==zer)return str;
	if(a==zer&&b==on)return hal;
	if(a==zer&&b==mon)return mhal;
	if(a==zer&&b==dow)return str;
	if(a==zer&&b==str)return upp;
	if(a==mon&&b==em)return zer;
	if(a==mon&&b==on)return zer;
	if(a==mon&&b==zer)return mhal;
	if(a==mhal&&b==em)return zer;
	if(a==upp&&b==dow)return str;
	if(a==str&&b==zer)return dow;
	assert(0);
	return em;
}
surnum dfs(int zt){
	if(f[zt].zz>=0)return f[zt];
	int aa[15];
	int xx=zt;
	for(int i=4;i>=0;--i)aa[i]=xx%3,xx/=3;
	surnum L=em,R=em;
	for(int i=0;i<4;++i)if(aa[i]==0&&aa[i+1]==2){
		swap(aa[i],aa[i+1]);
		int zt=0;
		for(int j=0;j<=4;++j)zt=zt*3+aa[j];
		L=dfs(zt);
		swap(aa[i],aa[i+1]);
	}
	for(int i=0;i<3;++i)if(aa[i]==0&&aa[i+1]==1&&aa[i+2]==2){
		swap(aa[i],aa[i+2]);
		int zt=0;
		for(int j=0;j<=4;++j)zt=zt*3+aa[j];
		L=dfs(zt);
		swap(aa[i],aa[i+2]);
	}
	for(int i=1;i<=4;++i)if(aa[i]==1&&aa[i-1]==2){
		swap(aa[i],aa[i-1]);
		int zt=0;
		for(int j=0;j<=4;++j)zt=zt*3+aa[j];
		R=dfs(zt);
		swap(aa[i],aa[i-1]);
	}
	for(int i=2;i<=4;++i)if(aa[i]==1&&aa[i-1]==0&&aa[i-2]==2){
		swap(aa[i],aa[i-2]);
		int zt=0;
		for(int j=0;j<=4;++j)zt=zt*3+aa[j];
		R=dfs(zt);
		swap(aa[i],aa[i-2]);
	}
	return f[zt]=L+R;
}
int powdv(int x,int y=mod-2){
	int ans=1;
	while(y){
		if(y&1)ans=1ll*ans*x%mod;
		y>>=1,x=1ll*x*x%mod;
	}
	return ans;
}
int di[1000005],id[1000005];
int CCC(int n,int m){
	if(n<0||m<0||n<m)return 0;
	return 1ll*di[n]*id[m]%mod*id[n-m]%mod;
}
int s[1000005];
int tt[1000005];
int main(){
	di[0]=1;
	for(int i=1;i<=1000000;++i)di[i]=1ll*i*di[i-1]%mod;
	id[1000000]=powdv(di[1000000]);
	for(int i=1000000-1;i>=0;--i)id[i]=1ll*id[i+1]*(i+1)%mod;
	for(int i=0;i<243;++i)f[i].zz=-1;
	dfs(22);
	int tcs;
	scanf("%d",&tcs);
	int T;
	scanf("%d",&T);
	while(T--){
		int n;
		scanf("%d",&n);
		int A=0,B=0,C=0,D=0,E=0;
		int F=0,G=0,H=0;
		for(int i=1;i<=n;++i){
			char op[15];
			int a;
			scanf("%s%d",op+1,&a);
			int zt=0;
			for(int j=1;j<=5;++j){
				int aa=0;
				if(op[j]=='R')aa=1;
				else if(op[j]=='_')aa=2;
				zt=zt*3+aa;
			}
			int zz=f[zt].zz;
			assert(zz);
			if(zz==1)C+=a;
			else if(zz==2)E+=a;
			else if(zz==3)A+=a;
			else if(zz==4)D+=a;
			else if(zz==5)B+=a;
			else if(zz==6)G+=a;
			else if(zz==7)F+=a;
			else H+=a;
		}
		for(int i=0;i<=A+E;++i){
			s[i+1]=(s[i]+CCC(A+E,i))%mod;
		}
		int aA=0,aB=0,aC=0;
		for(int i=-B;i<=D;++i){
			int cj=CCC(B+D,i+B);
			int lb=max(-1,min(E,(-i-1+MX)/2-MX/2)+A)+1;
			int rb=min(A+E+1,max(-A,(-i+MX)/2-MX/2+1)+A)+1;
			aA=(aA+1ll*cj*s[lb])%mod;
			aC=(aC+1ll*cj*(0ll+s[A+E+1]-s[rb-1]+mod))%mod;
		}
		aB=(0ll+powdv(2,A+B+D+E)-aA-aC+mod+mod)%mod;
		int pd=powdv(2,C);
		aA=1ll*aA*pd%mod,aB=1ll*aB*pd%mod,aC=1ll*aC*pd%mod;
		int dp=powdv(2,F+G+H);
		aA=1ll*aA*dp%mod,aC=1ll*aC*dp%mod;
		int c0=0,c1=0;
		if(!H)c0=1;
		else c0=c1=powdv(2,H-1);
		for(int i=0;i<=F+G;++i){
			tt[i]=CCC(F+G,i);
		}
		int aaA=0,aaB=0;
		int aD=0,aE=0;//=0,||0
		for(int i=0;i<=F+G;++i){
			if(i<F){
				aaA=(aaA+1ll*c0*tt[i])%mod;
			}else if(i==F){
				aD=(aD+1ll*c0*tt[i])%mod;
			}else{
				aaB=(aaB+1ll*c0*tt[i])%mod;
			}
			if(i<F-1){
				aaA=(aaA+1ll*c1*tt[i])%mod;
			}else if(i<=F+1){
				aE=(aE+1ll*c1*tt[i])%mod;
			}else{
				aaB=(aaB+1ll*c1*tt[i])%mod;
			}
		}
		aA=(aA+1ll*aaA*aB)%mod;
		aC=(aC+1ll*aaB*aB)%mod;
		aD=1ll*aB*aD%mod;
		aE=1ll*aB*aE%mod;
		printf("%d %d %d %d\n",aC,aA,aE,aD);
	}
	return 0;
}