#include<bits/stdc++.h>

#define vc vector
#define pb emplace_back
#define pii pair<int, int>
#define mkp make_pair
#define rep(i, a, b) for(int i = (a); i <= (b); ++i)
#define lep(i, a, b) for(int i = (a); i >= (b); --i)

using namespace std;

inline int read() {
	int x = 0, w = 0; char ch = getchar(); while(!isdigit(ch)) w |= (ch == '-'), ch = getchar();
	while(isdigit(ch)) x = x * 10 + (ch ^ 48), ch = getchar(); return w ? -x : x; 
}

const int N = 2e5 + 5;

int n, m; 
string A, B, C, T;
map<string, int> Map;

inline string crossing(string s, string t) {
	string str; 
	rep(i, 0, n - 1) 
		if(s[i] == t[i]) str += s[i];
		else if(s[i] != 'J' && t[i] != 'J') str += 'J';
		else if(s[i] != 'O' && t[i] != 'O') str += 'O';
		else str += 'I';
	return str;
}

signed main() {
	n = read();
	cin >> A >> B >> C;
	Map[A] = Map[B] = Map[C] = Map[crossing(A, B)] = Map[crossing(A, C)] = 1;
	Map[crossing(B, C)] = Map[crossing(A, crossing(B, C))] = 1;
	
	m = read();
	cin >> T;
	puts(Map[T] ? "Yes" : "No");
	for(int t = 1, l, r; t <= m; t++) {
		l = read(); r = read(); char ch = getchar();
		rep(i, l - 1, r - 1) T[i] = ch;
		puts(Map[T] ? "Yes" : "No");
	}
	return 0;
}