#include "bits/stdc++.h"
using namespace std;
#define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i))
#define rep(i,j) FOR(i,0,j)
#define each(x,y) for(auto &(x):(y))
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<(x)<<endl
#define smax(x,y) (x)=max((x),(y))
#define smin(x,y) (x)=min((x),(y))
#define MEM(x,y) memset((x),(y),sizeof (x))
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;

int main(){
    int N, S, X, Y, Z, Q;
    cin >> N >> S >> X >> Y >> Z >> Q;
    vll A(N);
    A[0] = S;
    rep(i, N - 1){
        A[i + 1] = (X*A[i] + Y) % Z;
    }
    
    vector<unsigned long long> v((sz(A) + 64 - 1) / 64), w(2*N);
    rep(i, N){
        A[i] %= 2;
        if(A[i])v[i / 64] |= 1ull << (i % 64);
    }
    auto tmp = v;
    
    while(Q--){
        int T, U, V, u;
        scanf("%d%d%d%d", &S, &T, &U, &V);
        S--; U--;
        FOR(i, S / 64, T / 64 + (T % 64 != 0))tmp[i] = v[i];
        u = U;
        while(S < T && S%64){
            v[U / 64] ^= (tmp[S / 64]>>(S%64)&1ull)<<(U%64);
            S++; U++;
        }

        while(S < T && T%64){
            --T; --V;
            v[V / 64] ^= (tmp[T / 64]>>(T%64)&1ull)<<(V%64);
        }

        if(U % 64 == 0){
            rep(i, (T - S)/64){
                int a = S/64 + i;
                int b = U/64 + i;
                v[b] ^= tmp[a];
            }
        } else{
            int d = U % 64;
            rep(i, (T - S)/64){
                int a = S/64 + i;
                int b = U/64 + i;
                v[b] ^= tmp[a] << d;
                v[b + 1] ^= tmp[a] >> (64-d);
            }
        }
    }

    string ans;
    rep(i, N){
        if(v[i / 64] >> (i % 64) & 1)ans += 'O';
        else ans += 'E';
    }
    printf("%s\n", ans.c_str());
}