#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[8]={1,0,-1,0,1,1,-1,-1};
const ll dx[8]={0,-1,0,1,1,-1,1,-1};
template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
using ull=unsigned long long;
ull a[31400];
ull tmp[1570];
int main(){
    ll n,s,x,y,z;cin >> n >> s >> x >> y >> z;
    ll now=s;
    memset(a,0,sizeof(a));
    rep(i,n){
        a[i>>6]|=(ull(now)&1)<<(i&63);
        now=(x*now+y)%z;
    }
    ll q;cin >> q;
    while(q--){
        ll s,t,x,y;cin >> s >> t >> x >>y;s--;t--;x--;y--;
        ll i,j;
        ll len=(t-s+1);
        ll p=s&63;
        ll z=64-p;
        for(i=0,j=s>>6;(i<<6)<len;i++,j++){
            tmp[i]=a[j]>>p;
            if(p)tmp[i]|=a[j+1]<<z;
        }
        /*for(ll c=0;c<n;c++){
            cout << (a[c>>6]>>(c&63)&1);
        }cout << endl;
        for(ll c=0;c<len;c++){
            cout << (tmp[c>>6]>>(c&63)&1);
        }cout << endl;*/
        z=64-(len&63);
        if(z!=64)tmp[i-1]=tmp[i-1]<<z>>z;
        p=x&63;
        z=64-p;
        for(i=0,j=x>>6;(i<<6)<len;i++,j++){
            a[j]^=tmp[i]<<p;
            if(p)a[j+1]^=tmp[i]>>z;
        }
    }
    rep(i,n){
        cout << (a[i>>6]>>(i%63)&1? 'O':'E');
    }
    cout << endl;
}