// 那就是希望。
// 即便需要取模，也是光明。

#include <algorithm>
#include <stdio.h>
#include <vector>
typedef long long llt;
typedef unsigned uint;typedef unsigned long long ullt;
typedef bool bol;typedef char chr;typedef void voi;
typedef double dbl;
template<typename T>bol _max(T&a,T b){return(a<b)?a=b,true:false;}
template<typename T>bol _min(T&a,T b){return(b<a)?a=b,true:false;}
template<typename T>T lowbit(T n){return n&-n;}
template<typename T>T gcd(T a,T b){return b?gcd(b,a%b):a;}
template<typename T>T lcm(T a,T b){return(a!=0||b!=0)?a/gcd(a,b)*b:(T)0;}
template<typename T>T exgcd(T a,T b,T&x,T&y){if(b!=0){T ans=exgcd(b,a%b,y,x);y-=a/b*x;return ans;}else return y=0,x=1,a;}
template<typename T>T power(T base,T index,T mod)
{
    T ans=1%mod;
    while(index)
    {
        if(index&1)ans=ans*base%mod;
        base=base*base%mod,index>>=1;
    }
    return ans;
}
namespace ConstMod
{
    template<const ullt p>
    class mod_ullt
    {
        private:
            ullt v;
            inline ullt chg(ullt w){return(w<p)?w:w-p;}
            inline mod_ullt _chg(ullt w){mod_ullt ans;ans.v=(w<p)?w:w-p;return ans;}
        public:
            mod_ullt():v(0){}
            mod_ullt(ullt v):v(v%p){}
            bol empty(){return!v;}
            inline ullt val(){return v;}
            friend bol operator<(mod_ullt a,mod_ullt b){return a.v<b.v;}
            friend bol operator>(mod_ullt a,mod_ullt b){return a.v>b.v;}
            friend bol operator<=(mod_ullt a,mod_ullt b){return a.v<=b.v;}
            friend bol operator>=(mod_ullt a,mod_ullt b){return a.v>=b.v;}
            friend bol operator==(mod_ullt a,mod_ullt b){return a.v==b.v;}
            friend bol operator!=(mod_ullt a,mod_ullt b){return a.v!=b.v;}
            inline friend mod_ullt operator+(mod_ullt a,mod_ullt b){return a._chg(a.v+b.v);}
            inline friend mod_ullt operator-(mod_ullt a,mod_ullt b){return a._chg(a.v+a.chg(p-b.v));}
            inline friend mod_ullt operator*(mod_ullt a,mod_ullt b){return a.v*b.v;}
            friend mod_ullt operator/(mod_ullt a,mod_ullt b){return b._power(p-2)*a.v;}
            friend mod_ullt operator^(mod_ullt a,ullt b){return a._power(b);}
            inline mod_ullt operator-(){return _chg(p-v);}
            mod_ullt sqrt()
            {
                if(power(v,(p-1)>>1,p)!=1)return 0;
                mod_ullt b=1;do b++;while(b._power((p-1)>>1)==1);
                ullt t=p-1,s=0,k=1;while(!(t&1))s++,t>>=1;
                mod_ullt x=_power((t+1)>>1),e=_power(t);
                while(k<s)
                {
                    if(e._power(1llu<<(s-k-1))!=1)x*=b._power((1llu<<(k-1))*t);
                    e=_power(p-2)*x*x,k++;
                }
                return _min(x,-x),x;
            }
            mod_ullt inv(){return _power(p-2);}
            mod_ullt _power(ullt index){mod_ullt ans(1),w(v);while(index){if(index&1)ans*=w;w*=w,index>>=1;}return ans;}
            voi read(){v=0;chr c;do c=getchar();while(c>'9'||c<'0');do v=(c-'0'+v*10)%p,c=getchar();while(c>='0'&&c<='9');v%=p;}
            voi print()
            {
                static chr C[20];uint tp=0;
                ullt w=v;do C[tp++]=w%10+'0',w/=10;while(w);
                while(tp--)putchar(C[tp]);
            }
            voi println(){print(),putchar('\n');}
            mod_ullt operator++(int){mod_ullt ans=*this;return v=chg(v+1),ans;}
        public:
            inline ullt&operator()(){return v;}
            inline mod_ullt&operator+=(mod_ullt b){return*this=_chg(v+b.v);}
            inline mod_ullt&operator-=(mod_ullt b){return*this=_chg(v+chg(p-b.v));}
            inline mod_ullt&operator*=(mod_ullt b){return*this=v*b.v;}
            mod_ullt&operator^=(ullt b){return*this=_power(b);}
            mod_ullt&operator/=(mod_ullt b){return*this=b._power(p-2)*v;}
            mod_ullt&operator++(){return v=chg(v+1),*this;}
    };
}
// Heaven and Earth... My guiding star...
// Akira Complex R.I.P.
const ullt Mod=998244353;
typedef ConstMod::mod_ullt<Mod>modint;
typedef std::vector<modint>modvec;
modint P[1000005],Q[1000005];
uint A[100001];
voi solve()
{
    static uint Cnt[9];for(auto&s:Cnt)s=0;
    uint q;scanf("%u",&q);
    while(q--)
    {
        static chr C[7];uint c,p=0;scanf("%s%u",C,&c);
        for(uint i=0;i<5;i++)p=p*10+(C[i]!='_'?C[i]=='R'?3:2:1);
        Cnt[A[p]]+=c;
    }
    modint ansA,ansB,ansF,ansS,g;
    {
        static modint X[1000005];
        uint a=Cnt[1]+Cnt[2],b=Cnt[3]+Cnt[4],d=Cnt[2]+Cnt[4]*2;modint x;
        for(uint i=0;i<=a;i++)X[i]=Q[i]*Q[a-i];
        for(uint i=a<d?(d-a+1)/2:0;i<=b&&i*2<=d;i++)g+=X[d-i*2]*Q[i]*Q[b-i];
        for(uint i=1;i<=a;i++)X[i]+=X[i-1];
        for(uint i=0;i<=b&&i*2<=d;i++)x+=X[std::min(d-i*2,a)]*Q[i]*Q[b-i];
        modint w=modint(2)^(Cnt[5]+Cnt[6]+Cnt[7]);
        x*=P[a]*P[b],g*=P[a]*P[b],ansA=w*((modint(2)^(a+b))-x),ansB=w*(x-g);
    }
    {
        uint a=Cnt[6]+Cnt[7],d=Cnt[7];modint x,y,z,w,v;
        for(uint i=0;i<=a;i++)(i<=d?(i<d?(i+1==d?y:x):z):(i==d+1?w:v))+=Q[i]*Q[a-i];
        g*=P[a];
        if(Cnt[5])g*=modint(2)^(Cnt[5]-1),ansA+=(w+2*v)*g,ansB+=(2*x+y)*g,ansF+=(y+z+w)*g,ansS+=z*g;
        else ansA+=(w+v)*g,ansB+=(x+y)*g,ansS+=z*g;
    }
    if(Cnt[0])g=modint(2)^Cnt[0],ansA*=g,ansB*=g,ansF*=g,ansS*=g;
    ansA.print(),putchar(' '),ansB.print(),putchar(' '),ansF.print(),putchar(' '),ansS.println();
}
int main()
{
#ifdef MYEE
    freopen("QAQ.in","r",stdin);
    freopen("QAQ.out","w",stdout);
#endif
    P[0]=1;for(uint i=1;i<=1000000;i++)P[i]=P[i-1]*i;
    Q[1000000]=P[1000000].inv();for(uint i=1000000;i;i--)Q[i-1]=Q[i]*i;
    A[12233]=A[33221]=A[23231]=A[23123]=A[12323]=A[23312]=A[31223]=A[31232]=A[32312]=A[33122]=0;
    A[32123]=1,A[23132]=2,A[33212]=A[32321]=A[23321]=3,A[31322]=A[13232]=A[13223]=4;
    A[23213]=A[21323]=A[22133]=5,A[21233]=6,A[22313]=7;
    uint t;scanf("%*u%u",&t);while(t--)solve();
    return 0;
}

// 那就是希望。
// 即便需要取模，也是光明。