#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef array<int, 3> vec;
typedef array<vec, 3> mat;
const int mod = 998244353;
const int N = 1e6 + 5;

mat left(vec p) {
	return mat{vec{0, -p[2], p[1]}, vec{p[2], 0, -p[0]}, vec{-p[1], p[0], 0}};
}

mat right(vec p) {
	return mat{vec{0, p[2], -p[1]}, vec{-p[2], 0, p[0]}, vec{p[1], -p[0], 0}};
}

mat leaf(vec p) {
	return mat{vec{p[0], 0, 0}, vec{p[1], 0, 0}, vec{p[2], 0, 0}};
}

vec operator*(mat p, vec q) {
	vec r = {0, 0, 0};
	for (int i = 0; i < 3; i++)
		for (int j = 0; j < 3; j++)
			r[i] = (r[i] + p[i][j] * 1ll * q[j]) % mod;
	return r;
}

mat operator*(mat p, mat q) {
	mat r;
	for (int i = 0; i < 3; i++) {
		r[i] = {0, 0, 0};
		for (int j = 0; j < 3; j++)
			for (int k = 0; k < 3; k++)
				r[i][j] = (r[i][j] + p[i][k] * 1ll * q[k][j]) % mod;
	}
	return r;
}

struct segment_tree {
  using data = mat;
  data id = mat{vec{1,0,0}, vec{0,1,0}, vec{0,0,1}};
  static data combine(data dl, data dr) {
  	return dl * dr;
  };
  int n, h;
  vector<data> t;
  segment_tree(int n = 0) : n(n), h(32 - __builtin_clz(n)), t(2 * n) {}
  segment_tree(vector<data> & a) : segment_tree(a.size()) {
    for (int i = 0; i < n; i++)
      t[i + n] = a[i];
    for (int x = n - 1; x > 0; x--)
      t[x] = combine(t[x << 1], t[x << 1 | 1]);
  }
  void build(int x) {
    while (x >>= 1)
      t[x] = combine(t[x << 1], t[x << 1 | 1]);
  }
  // set the data at the position i
  void setValue(int i, data d) {
    i += n;
    t[i] = d;
    build(i);
  }
  // query the data on the range [l, r[
  data query(int l, int r) {
    l += n; r += n;
    data dl = id, dr = id;
    for (; l < r; l >>= 1, r >>= 1) {
      if (l & 1)
        dl = combine(dl, t[l++]);
      if (r & 1)
        dr = combine(t[--r], dr);
    }
    return combine(dl, dr);
  }
};


int L[N], R[N], s[N], par[N], idx[N], head[N], en[N], curt = 0;
vec a[N];
segment_tree seg;

int dfs(int u, int p = -1) {
	if (!u) return 0;
	par[u] = p;
	int x = L[u], y = R[u];
	s[u] = 1 + dfs(x, u) + dfs(y, u);
	if (s[x] <= s[y])
		swap(x, y);
	if (R[u] != 0)
		a[u] = left(a[L[u]]) * a[R[u]];
	return s[u];
}

void upd(int u) {
	int x = L[u], y = R[u];
	seg.setValue(idx[u], !x ? leaf(a[u]) : (s[x] > s[y] ? right(a[y]) : left(a[x])));
}

void dfs2(int u) {
	if (!u) return;
	idx[u] = curt++;
	int x = L[u], y = R[u];
	if (s[x] <= s[y])
		swap(x, y);
	head[x] = head[u];
	head[y] = y;
	en[u] = u;
	dfs2(x);
	dfs2(y);
	if (x != 0)
		en[u] = en[x];
	upd(u);
}

int main() {
	ios_base::sync_with_stdio(false); cin.tie(0);
	int n, q; cin >> n >> q;
	for (int i = 1; i <= n; i++) {
		char c; cin >> c;
		if (c == 'x')
			cin >> L[i] >> R[i];
		else
			cin >> a[i][0] >> a[i][1] >> a[i][2];
	}
	dfs(1);
	seg = segment_tree(n + 1);
	head[1] = 1;
	dfs2(1);
	while (q--) {
		int i; cin >> i;
		cin >> a[i][0] >> a[i][1] >> a[i][2];
		while (i > 0) {
			upd(i);
			int j = head[i];
			auto p = seg.query(idx[j], idx[en[i]] + 1);
			a[j] = vec{p[0][0], p[1][0], p[2][0]};
			i = par[j];
		}
		cout << a[1][0] << " " << a[1][1] << " " << a[1][2] << "\n";
	}
}