#include<bits/stdc++.h>
#define ll long long
#define int long long
using namespace std;
const int MOD=998244353;

struct mat
{
	int a[3][3];
	mat(){memset(a,0,sizeof(a));}
	mat operator*(const mat &m)const
	{
		mat ret;
		for(int i=0;i<3;i++)
			for(int j=0;j<3;j++)
				for(int k=0;k<3;k++)
					ret.a[i][k]+=a[i][j]*m.a[j][k];
		for(int i=0;i<3;i++)
			for(int j=0;j<3;j++)
				ret.a[i][j]%=MOD;
		return ret;
	}
};
struct vc
{
	int x,y,z;
	vc operator+(const vc &k)const{return (vc){(x+k.x)%MOD,(y+k.y)%MOD,(z+k.z)%MOD};}
	vc operator-(const vc &k)const{return (vc){(x-k.x)%MOD,(y-k.y)%MOD,(z-k.z)%MOD};}
	vc operator*(const int k)const{return (vc){(x*k)%MOD,(y*k)%MOD,(z*k)%MOD};}
	vc operator*(const vc &k)const{return (vc){(y*k.z-z*k.y)%MOD,(z*k.x-x*k.z)%MOD,(x*k.y-y*k.x)%MOD};}
	vc operator*(const mat &m)const{return (vc){(x*m.a[0][0]+y*m.a[1][0]+z*m.a[2][0])%MOD,(x*m.a[0][1]+y*m.a[1][1]+z*m.a[2][1])%MOD,(x*m.a[0][2]+y*m.a[1][2]+z*m.a[2][2])%MOD};}
//	vc operator^(const vc &k)const{return (vc){(x*k.x)%MOD,(y*k.y)%MOD,(z*k.z)%MOD};}
	mat conv(int ty)//L/R
	{
		mat ret;
		/*
		  o
		 / .
		o   o
		*/
		if(ty==1)
		{
			ret.a[0][0]=0;ret.a[0][1]=-z;ret.a[0][2]=y;
			ret.a[1][0]=z;ret.a[1][1]=0;ret.a[1][2]=-x;
			ret.a[2][0]=-y;ret.a[2][1]=x;ret.a[2][2]=0;
		}
		/*
		  o
		 . \
		o   o
		*/
		else
		{
			ret.a[0][0]=0;ret.a[0][1]=z;ret.a[0][2]=-y;
			ret.a[1][0]=-z;ret.a[1][1]=0;ret.a[1][2]=x;
			ret.a[2][0]=y;ret.a[2][1]=-x;ret.a[2][2]=0;
		}
		return ret;
	}
	friend ostream& operator<<(ostream &os,const vc &k){os<<k.x<<' '<<k.y<<' '<<k.z;return os;}
};
const int MAXN=555555;
mat seg[MAXN];
int lson[MAXN],rson[MAXN];
int top0,root;
int build(int l,int r)
{
	int ret=++top0;
	if(l!=r)
	{
		int mid=(l+r)/2;
		ret[lson]=build(l,mid);
		ret[rson]=build(mid+1,r);
	}
	return ret;
}
void upd(int cur)
{
	cur[seg]=cur[rson][seg]*cur[lson][seg];
}
void change(int cur,int l,int r,int pos,const mat &m)
{
	if(l==r)
	{
		cur[seg]=m;
		return;
	}
	int mid=(l+r)/2;
	if(pos<=mid)change(cur[lson],l,mid,pos,m);
	else change(cur[rson],mid+1,r,pos,m);
	upd(cur);
}
vc query(int cur,int l,int r,int ql,int qr,const vc &v)
{
	if(l==ql and r==qr)return v*cur[seg];
	int mid=(l+r)/2;
	if(qr<=mid)return query(cur[lson],l,mid,ql,qr,v);
	else if(ql>=mid+1)return query(cur[rson],mid+1,r,ql,qr,v);
	else
	{
		auto tv=query(cur[rson],mid+1,r,mid+1,qr,v);
		return query(cur[lson],l,mid,ql,mid,tv);
	}
}
signed main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	
	int n,q;
	
	cin>>n>>q;
	vector<vc> a(n+5);
	vector<int> L(n+5),R(n+5),pa(n+5);
	for(int i=1;i<=n;i++)
	{
		string ty;
		cin>>ty;
		if(ty=="x")
		{
			cin>>L[i]>>R[i];
			pa[L[i]]=i;pa[R[i]]=i;
		}
		else
		{
			cin>>a[i].x>>a[i].y>>a[i].z;
		}
	}
	
	root=build(1,n);
	
	vector<int> siz(n+5),dep(n+5),ty(n+5),dfn(n+5),top(n+5),bot(n+5);
	function<void(int)> dfs1=[&](int u)
	{
		siz[u]=1;
		if(L[u])
		{
			dep[L[u]]=dep[u]+1;
			dfs1(L[u]);
			dep[R[u]]=dep[u]+1;
			dfs1(R[u]);
			siz[u]+=siz[L[u]]+siz[R[u]];
			if(siz[L[u]]>siz[R[u]])
				ty[u]=0,bot[u]=bot[L[u]];
			else
				ty[u]=1,bot[u]=bot[R[u]];
		}
		else
		{
			bot[u]=u;
		}
	};
	dep[1]=1;
	dfs1(1);
	
	auto updt=[&](int u)
	{
//		cerr<<"updt "<<u<<endl;
		if(ty[u]==0)
		{
			auto tv=a[bot[R[u]]];
			if(bot[R[u]]!=top[R[u]])
			{
				tv=query(root,1,n,dfn[R[u]],dfn[pa[bot[R[u]]]],tv);
			}
//			cerr<<tv<<endl;
			change(root,1,n,dfn[u],tv.conv(1));
		}
		else
		{
			auto tv=a[bot[L[u]]];
			if(bot[L[u]]!=top[L[u]])
			{
				tv=query(root,1,n,dfn[L[u]],dfn[pa[bot[L[u]]]],tv);
			}
//			cerr<<tv<<endl;
			change(root,1,n,dfn[u],tv.conv(0));
		}
	};
	
	int idx=0;
	function<void(int)> dfs2=[&](int u)
	{
		dfn[u]=++idx;
		if(L[u])
		{
			if(ty[u]==0)
			{
				top[L[u]]=top[u];
				dfs2(L[u]);
				top[R[u]]=R[u];
				dfs2(R[u]);
			}
			else
			{
				top[R[u]]=top[u];
				dfs2(R[u]);
				top[L[u]]=L[u];
				dfs2(L[u]);
			}
			updt(u);
		}
	};
	top[1]=1;
	dfs2(1);
	
	/*
	cerr<<"i\tdfn\tty\ttop\tbot\n";
	for(int i=1;i<=n;i++)
	{
		cerr<<i<<'\t'<<dfn[i]<<'\t'<<ty[i]<<'\t'<<top[i]<<'\t'<<bot[i]<<endl;
	}
	*/
	for(int i=1;i<=q;i++)
	{
		int pos;
		vc d;
		cin>>pos>>d.x>>d.y>>d.z;
		
		a[pos]=d;
		pos=pa[top[pos]];
		while(pos)
		{
			updt(pos);
			pos=pa[top[pos]];
		}
		
		auto tv=a[bot[1]];
		tv=query(root,1,n,dfn[1],dfn[pa[bot[1]]],tv);
//		cerr<<"ans"<<endl;
		cout<<tv.x<<' '<<tv.y<<' '<<tv.z<<"\n";
	}
	
	cerr<<clock()<<endl;
	return 0;
}