#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int N = (int)1e6 + 12;

int n, m;
string t;
vector<string> a(3);
map<string, bool> mem;
string nv(string x, string y) {
    string ret;
    for(int i = 0; i < n; i++) {
        if(x[i] == y[i]) ret += x[i];
        else {
            char f;
            if(x[i] != 'O' && y[i] != 'O') f = 'O';
            else if(x[i] != 'J' && y[i] != 'J') f = 'J';
            else f = 'I';
            ret += f;
        }
    }
    return ret;
}

void out() {
    cout << (mem.count(t) ? "Yes\n" : "No\n");
}
void test() {
    cin >> n >> a[0] >> a[1] >> a[2];
    cin >> m >> t;
    queue<string> q;
    q.push(a[0]);mem[a[0]];
    if(!mem.count(a[1])) q.push(a[1]);mem[a[1]];
    if(!mem.count(a[2])) q.push(a[2]);mem[a[2]];
    while(!q.empty()) {
        auto r = q.front();
        q.pop();
        for(auto f : a) {
            string k = nv(f, r);
            if(!mem.count(k)) {
                mem[k];
                q.push(k);
            }
        }
        a.push_back(r);
    }
    out();
    while(m--) {
        int l, r;
        char x;
        cin >> l >> r >> x;
        l--;r--;
        for(int i = l; i <= r; i++) {
            t[i] = x;
        }
        out();
    }
    assert((int)mem.size() <= n * (1 +(int)log2(n)));
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int t = 1;
    //cin >> t;

    while(t--)
        test();

    return 0;
}