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

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    unsigned long long n, s, x, y, z;
    cin >> n >> s >> x >> y >> z;
    vector<unsigned long long> a(n);
    array<unsigned long long, 40000> v{};
    array<unsigned long long, 2000> temp{};
    a[0] = s;
    for(int i = 1; i < n; i++){
        a[i] = (x * a[i - 1] + y) % z;
    }
    int sz = (n + 63) / 64, q, S, T, U, V;
    for(int i = 0, j = 0, k = 0; i < n; i++){
        v[k] |= (a[i] & 1ULL) << j;
        if(++j == 64) j = 0, k++;
    }
    cin >> q;
    while(q--){
        cin >> S >> T >> U >> V;
        S--, U--;
        int len = T - S, r = ((len + 63) / 64), smod = S & 63, umod = U & 63;
        temp[len >> 6] = 0;
        for(int i = 0; i < len / 64; i++){
            temp[i] = v[S / 64 + i] >> smod;
            if(smod)temp[i] |= v[S / 64 + i + 1] << 64 - smod;
        }
        for(int i = 0, idx = S + len / 64 * 64; i < (len & 63); i++, idx++){
            if((v[idx / 64] >> (idx & 63)) & 1)temp[len / 64] |= 1ULL << i;
        }
        for(int i = 0; i < r; i++){
			v[U / 64 + i] ^= temp[i] << umod;
			if(umod) v[U / 64 + i + 1] ^= temp[i] >> 64 - umod;
		}
    }
    for(int i = 0, j = 0, k = 0; i < n; i++){
        cout << ((v[k] >> j) & 1 ? 'O' : 'E');
        if(++j == 64)j = 0, k++;
    }
    cout << '\n';
}