#include <bits/stdc++.h>

#define pb push_back
#define mp make_pair
#define fi first
#define se second

typedef long long LL;

using namespace std;

template <typename T> void inline chkMax(T &x, T y) { if (y > x) x = y; }
template <typename T> void inline chkMin(T &x, T y) { if (y < x) x = y; }


template <typename T> void inline read(T &x) {
    int f = 1; x = 0; char s = getchar();
    while (s < '0' || s > '9') { if (s == '-') f = -1; s = getchar(); }
    while (s <= '9' && s >= '0') x = x * 10 + (s ^ 48), s = getchar();
    x *= f;
}

const int N = 2e5 + 5;

int t[300];

char c[3] = { 'J', 'O', 'I' };

char tr(char a, char b) {
	if (a == b) return a;
	return c[3 - t[a] - t[b]];
}

int n, q;

string A, B, C;

string work(string a, string b) {
	string c = "";
	for (int i = 0; i < n; i++) {
		c += tr(a[i], b[i]);
	}
	return c;
}

set<string> s;

string g[9], T;

int tot, LA[9][N][3];

void dfs(string u) {
	if (s.count(u)) return;
	s.insert(u);
	dfs(work(u, A));
	dfs(work(u, B));
	dfs(work(u, C));
}


void inline prework() {
	t['O'] = 1, t['I'] = 2;
	cin >> n >> A >> B >> C;
	dfs(A);
	dfs(B);
	dfs(C);
	for (string v: s) {
		g[tot++] = v;
	}
	for (int i = 0; i < tot; i++) {
		for (int j = 1; j <= n; j++) {
			for (int k = 0; k < 3; k++)
				LA[i][j][k] = LA[i][j - 1][k];
			LA[i][j][t[g[i][j - 1]]] = j;
		}
	}
}

#define ls p << 1
#define rs p << 1 | 1

int tag[N << 2], L[N << 2], R[N << 2];

bool dat[N << 2][9];

void inline pushup(int p) {
	for (int i = 0; i < tot; i++) {
		dat[p][i] = dat[ls][i] & dat[rs][i];
	}
}

void cover(int p, int k) {
	tag[p] = k;
	int c1 = k != 0 ? 0 : 1, c2 = 3 - k - c1;
	for (int i = 0; i < tot; i++) {
		dat[p][i] = LA[i][R[p]][c1] < L[p] && LA[i][R[p]][c2] < L[p];
	}
}

void inline pushdown(int p) {
	if (tag[p] != -1) {
		cover(ls, tag[p]);
		cover(rs, tag[p]);
		tag[p] = -1;
		return;
	}
}

void build(int p, int l, int r) {
	tag[p] = -1;
	L[p] = l, R[p] = r;
	if (l == r) {
		for (int i = 0; i < tot; i++) {
			dat[p][i] = g[i][r - 1] == T[r - 1];
		}
		return;
	}
	int mid = (l + r) >> 1;
	build(ls, l, mid);
	build(rs, mid + 1, r);
	pushup(p);
}

void change(int p, int l, int r, int x, int y, int k) {
	if (x <= l && r <= y) {
		cover(p, k);
		return;
	}
	pushdown(p);
	int mid = (l + r) >> 1;
	if (x <= mid) change(ls, l, mid, x, y, k);
	if (mid < y) change(rs, mid + 1, r, x, y, k);
	pushup(p);
}



void out() {
	bool o = 0;
	for (int i = 0; i < tot; i++) {
		o |= dat[1][i];
	}
	puts(o ? "Yes" : "No");
}

int main() {
	ios::sync_with_stdio(false);
	prework();
	cin >> q;
	cin >> T;
	build(1, 1, n);
	out();
	while (q--) {
		int l, r; char C;
		cin >> l >> r >> C;
		change(1, 1, n, l, r, t[C]);
		out();
	}
}