#include using namespace std; #define rep(i,n) for(ll i=0;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,greater> #define all(x) (x).begin(),(x).end() #define CST(x) cout<; using vvl=vector>; using pl=pair; using vpl=vector; using vvpl=vector; 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 inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; } template inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; } using ull=unsigned long long; ull a[31250]; ull tmp[1563]; 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]|=(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)>p; if(p)tmp[i]|=a[j+1]<>6]>>(c&63)&1); }cout << endl; for(ll c=0;c>6]>>(c&63)&1); }cout << endl;*/ z=64-(len&63); if(z!=64)tmp[i-1]=tmp[i-1]<>z; p=x&63; z=64-p; for(i=0,j=x>>6;(i<<6)>z; } } rep(i,n){ cout << (a[i>>6]>>(i%63)&1? 'O':'E'); } cout << endl; }