#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define X v[x].a[0][0]
#define Y v[x].a[1][0]
#define Z v[x].a[2][0]
#define mid (l+r)/2
#define ls rt*2
#define rs rt*2+1
const ll mod=998244353;
int n,q,l[200005],r[200005],siz[200005],top[200005],dfn[200005],tim,fa[200005],p[200005],bot[200005];
struct mat{
	ll a[3][3];
	mat(){
		memset(a,0,sizeof(a));
	}
	void g(){
		for(int i=0;i<3;i++) a[i][i]=1;
	}
	mat operator *(const mat &x)const{
		mat res;
		for(int i=0;i<3;i++)
			for(int j=0;j<3;j++)
				for(int k=0;k<3;k++)
					(res.a[i][j]+=a[i][k]*x.a[k][j]%mod)%=mod;
		return res;
	}
}v[200005],M[200005],tr[800005];
bool tag[200005];
void dfs1(int u){
	siz[u]=1;
	if(l[u]){
		dfs1(l[u]),siz[u]+=siz[l[u]];
		dfs1(r[u]),siz[u]+=siz[r[u]];
		if(siz[l[u]]<siz[r[u]]) swap(l[u],r[u]),tag[u]=1;
	}
}
void dfs2(int u,int t){
	top[u]=t;dfn[u]=++tim;p[dfn[u]]=u,bot[t]=u;
	if(l[u]){
		dfs2(l[u],t),dfs2(r[u],r[u]);
		int x=r[u];
		ll tmp[3][3]={0,Z,(mod-Y)%mod,(mod-Z)%mod,0,X,Y,(mod-X)%mod,0};
		memcpy(M[u].a,tmp,sizeof(tmp));
		v[u]=M[u]*v[l[u]];
	}else M[u]=v[u];
}
void dfs3(int u){
	if(l[u]) tag[l[u]]^=tag[u],tag[r[u]]^=tag[u],dfs3(l[u]),dfs3(r[u]);
}
void build(int l,int r,int rt){
	if(l==r){
		tr[rt]=M[p[l]];
		return;
	} 
	build(l,mid,ls),build(mid+1,r,rs);
	tr[rt]=tr[ls]*tr[rs];
}
void modify(int l,int r,int rt,int pos){
	if(l==r){
		tr[rt]=M[p[l]];
		return;
	} 
	if(pos<=mid) modify(l,mid,ls,pos);
	else modify(mid+1,r,rs,pos);
	tr[rt]=tr[ls]*tr[rs];
}
mat query(int l,int r,int rt,int L,int R){
	if(l>=L&&r<=R) return tr[rt];
	mat res;res.g();
	if(L<=mid) res=res*query(l,mid,ls,L,R);
	if(R>mid) res=res*query(mid+1,r,rs,L,R);
	return res;
}
int main(){
	int x,y;
	char s[3];
	scanf("%d%d",&n,&q);
	for(int i=1;i<=n;i++){
		scanf("%s",s);
		if(s[0]=='x'){
			scanf("%d%d",&x,&y);
			l[i]=x,r[i]=y;fa[x]=fa[y]=i;
		}
		else scanf("%lld%lld%lld",&v[i].a[0][0],&v[i].a[1][0],&v[i].a[2][0]);
	}
	dfs1(1);
	dfs2(1,1);
	dfs3(1);
	build(1,n,1);
	while(q--){
		scanf("%d",&x);
		scanf("%lld%lld%lld",&X,&Y,&Z);
		ll mul;
		if(tag[x]==1) mul=-1;
		else mul=1;
		M[x]=v[x],modify(1,n,1,dfn[x]);
		mat res;
		while(fa[top[x]]){
			int u=fa[top[x]];
			v[x]=query(1,n,1,dfn[top[x]],dfn[bot[top[x]]]);
			ll tmp[3][3]={0,Z,(mod-Y)%mod,(mod-Z)%mod,0,X,Y,(mod-X)%mod,0};
			memcpy(M[u].a,tmp,sizeof(tmp));
			modify(1,n,1,dfn[u]);
			x=u;
		}
		res=query(1,n,1,1,dfn[bot[1]]);
		printf("%lld %lld %lld\n",(res.a[0][0]*mul+mod)%mod,(res.a[1][0]*mul+mod)%mod,(res.a[2][0]*mul+mod)%mod);
	}
	return 0;
}