// test std

#include <bits/stdc++.h>
using namespace std;

typedef long long s64;
const int N = 12000 + 5, INF = int(1e9) + 5;
int readReg() {
	string reg;
	cin >> reg;
	return reg[0] - 'a';
}
int vis[16];
struct G {
	int nex[16];
	vector<int> chain[16], cycle[16];
	void init() {
		for (int j = 0; j < 16; ++j) {
			memset(vis, 0, sizeof(vis));
			int nt = 0, x = j;
			while (!vis[x]) {
				vis[x] = nt;
				++nt;
				x = nex[x];
			}
			int y = j;
			while (y != x) {
				chain[j].push_back(y);
				y = nex[y];
			}
			cycle[j].push_back(y);
			while ((y = nex[y]) != x)
				cycle[j].push_back(y);
		}
	}
	int calc(int t, int j) {
		return t < chain[j].size() ? chain[j][t] : cycle[j][(t - chain[j].size()) % cycle[j].size()];
	}
};
struct Op {
	int t, tot_1, tot;
	vector<Op*> son;
	vector<int> sum;
	vector<array<G, 8>> g1;
	G g[8];
	void read(string str) {
		int a, b;
		a = readReg();
		g1.resize(1);
		if (str.back() != 'i') {
			b = readReg();
			for (int i = 0; i < 8; ++i)
				for (int j = 0; j < 16; ++j) {
					int va = (j >> a) & 1,
						vb = (j >> b) & 1;
					int k = j ^ ((va ^ (str[0] == 'o' ? (va | vb) : (str[0] == 'a' ? (va & vb) : (va ^ vb)))) << a);
					g[i].nex[j] = g1[0][i].nex[j] = k;
				}
		} else {
			cin >> b;
			for (int i = 0; i < 8; ++i)
				for (int j = 0; j < 16; ++j) {
					int va = (j >> a) & 1,
						vb = (b >> i) & 1;
					int k = j ^ ((va ^ (str[0] == 'o' ? (va | vb) : (str[0] == 'a' ? (va & vb) : (va ^ vb)))) << a);
					g[i].nex[j] = g1[0][i].nex[j] = k;
				}
		}
		for (int i = 0; i < 8; ++i) {
			g[i].init();
			g1[0][i].init();
		}
	}
	void init(bool is_root) {
		if (!t) {
			tot_1 = tot = 1;
			return;
		}
		tot_1 = 0;
		auto son0 = son;
		son.clear();
		for (auto op: son0) {
			op->init(0);
			if (op->t == 1) {
				son.insert(son.end(), op->son.begin(), op->son.end());
			} else
				son.push_back(op);
			tot_1 = min(INF, tot_1 + op->tot);
		}
		if (tot_1 == INF) t = 1;
		tot = min(s64(INF), s64(tot_1) * t);
		if (t == 1 && !is_root) return;
		sum.resize(son.size() + 1);
		g1.resize(son.size() + 1);
		for (int i = 0; i < 8; ++i)
			for (int j = 0; j < 16; ++j)
				g1[0][i].nex[j] = j;
		for (int h = 0; h < son.size(); ++h) {
			sum[h + 1] = min(INF, sum[h] + son[h]->tot);
			for (int i = 0; i < 8; ++i) {
				for (int j = 0; j < 16; ++j) {
					g1[h + 1][i].nex[j] = son[h]->g[i].nex[g1[h][i].nex[j]];
				}
			}
		}
		for (int h = 0; h <= son.size(); ++h)
			for (int i = 0; i < 8; ++i)
				g1[h][i].init();
		for (int i = 0; i < 8; ++i) {
			for (int j = 0; j < 16; ++j)
				g[i].nex[j] = g1.back()[i].calc(t, j);
			g[i].init();
		}
	}
	int calc(int i, int k, int j) {
		assert(k <= tot);
		if (k >= tot_1) {
			j = g1.back()[i].calc(k / tot_1, j);
			k %= tot_1;
		}
		if (!k) return j;
		int h = lower_bound(sum.begin(), sum.end(), k) - sum.begin() - 1;
		return son[h]->calc(i, k - sum[h], g1[h][i].nex[j]);
	}
};
Op op[N];

int main() {
#ifdef kcz
	freopen("1.in", "r", stdin); //freopen("1.out","w",stdout);
#endif
	int n, q;
	cin >> n >> q;
	int t = 0;
	vector<int> st;
	++t;
	op[1].t = 1;
	st.push_back(1);
	for (int tmp = 1; tmp <= n; ++tmp) {
		string str;
		cin >> str;
		if (str == "end") {
			st.pop_back();
		} else {
			++t;
			op[st.back()].son.push_back(op + t);
			if (str == "repeat") {
				st.push_back(t);
				scanf("%d", &op[t].t);
			} else {
				op[t].read(str);
			}
		}
	}
	op[1].init(1);
	while (q--) {
		int k, a[4];
		cin >> k;
		for (int i = 0; i < 4; ++i) {
			cin >> a[i];
		}
		int ans[4] = {};
		for (int i = 0; i < 8; ++i) {
			int j = 0;
			for (int k = 0; k < 4; ++k) j |= ((a[k] >> i) & 1) << k;
			int x = op[1].calc(i, k, j);
			for (int k = 0; k < 4; ++k) ans[k] |= ((x >> k) & 1) << i;
		}
		for (int i = 0; i < 4; ++i) cout << ans[i] << " \n"[i == 3];
	}
}