#include<iostream>
#include<math.h>
#include<vector>
#include <array>
#include <algorithm>
#include <queue>
#include <numeric>
#include <map>

using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end());
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()
#define array2(type, x, y) array<array<type, y>, x>
#define vector2(type) vector<vector<type> >
#define out(...) //printf(__VA_ARGS__)

typedef pair<int, int> pos;
int pos::*x = &pos::first;
int pos::*y = &pos::second;

int dxy[] = {0, 1, 0, -1, 0};

/*================================*/

signed main()
{
    int N,S,X,Y,Z,Q;
    cin >> N >> S >> X >> Y >> Z >> Q;
    
    int A[N+1];
    A[0] = S;
    FOR(i,1,N+1) A[i] = ((X*A[i-1]+Y)%Z);
    
    int T,U,V;
    REP(i,Q) {
        scanf("%lld %lld %lld %lld", &S, &T, &U, &V);
        RFOR(k,U,V+1) {
            A[k-1] += A[S-1 + k-U];
        }
    }
    REP(i,N){
        printf("%c", ((A[i] % 2) ? 'O' : 'E'));
    }
    printf("\n");
    
    return 0;
}