#include<bits/stdc++.h>
#include<fstream>
using namespace std;
ifstream fin("VNOICUP.INP");
ofstream fout("VNOICUP.OUT");
#define sz(a) (int)a.size()
#define ll long long
#define pb push_back
#define forr(i, a, b) for(int i = a; i < b; i++)
#define dorr(i, a, b) for(int i = a; i >= b; i--)
#define ld long double
#define vt vector
#include<fstream>
#define fi first
#define se second
#define pll pair<ll, ll>
#define pii pair<int, int>
const ld PI = 3.14159265359;
using u128 = __uint128_t;
//const int x[4] = {1, -1, 0, 0};
//const int y[4] = {0, 0, 1, -1};
ll mod = 1e9 + 9, base = 75;
const int mxn = 2e5 + 5, mxq = 2e5 + 5, sq = 400, mxv = 2e5 + 5;
//const int base = (1 << 18);
const int inf = 1e9, neg = -69420;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll rr(ll l, ll r){
return(uniform_int_distribution<ll>(l, r)(rng));
}
map<ll, int>mp;
int to[mxn + 1];
ll pw[mxn + 1], n, q;
string s[3], t;
string conv(string a, string b){
string res = "";
for(int i = 0; i < sz(a); i++){
if(a[i] == b[i])res += a[i];
else if(a[i] == 'J'){
if(b[i] = 'O')res += 'I';
else res += 'O';
}else if(a[i] == 'O'){
if(b[i] == 'J')res += 'I';
else res += 'J';
}else{
if(b[i] == 'O')res += 'J';
else res += 'O';
}
}
return(res);
}
ll gethash(string s){
ll ans = 0;
for(int i = 0; i < sz(s); i++){
ans += pw[i] * to[s[i]];
ans %= mod;
}
return(ans);
}
void solve(string curr){
ll val = gethash(curr);
if(mp.find(val) != mp.end())return;
mp[val] = 1;
for(int i = 0; i < 3; i++){
solve(conv(curr, s[i]));
}
}
signed main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin >> n;
mod = rr(1e9, 1e15);
pw[0] = 1;
for(int i = 1; i <= n; i++){
pw[i] = (pw[i - 1] * base) % mod;
}
to['J'] = rr(1, 1000); to['O'] = rr(1, 1000); to['I'] = rr(1, 1000);
cin >> s[0] >> s[1] >> s[2];
vt<int>v;
for(int i = 0; i < 3; i++){
solve(s[i]);
}
cin >> q;
cin >> t;
ll ht = gethash(t);
if(mp.find(ht) != mp.end())cout << "Yes";
else cout << "No";
cout << "\n";
while(q--){
int l, r; char c; cin >> l >> r >> c; l--; r--;
for(int i = l; i <= r; i++)t[i] = c;
ll ht = gethash(t);
if(mp.find(ht) != mp.end())cout << "Yes";
else cout << "No";
cout << "\n";
}
}
