#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <queue>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstring>
#include <cctype>
#include <cassert>
#include <limits>
#include <functional>
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
#if defined(_MSC_VER) || __cplusplus > 199711L
#define aut(r,v) auto r = (v)
#else
#define aut(r,v) __typeof(v) r = (v)
#endif
#define each(it,o) for(aut(it, (o).begin()); it != (o).end(); ++ it)
#define all(o) (o).begin(), (o).end()
#define pb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
#define mset(m,v) memset(m,v,sizeof(m))
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
using namespace std;
typedef vector<int> vi; typedef pair<int,int> pii; typedef vector<pair<int,int> > vpii; typedef long long ll;
template<typename T, typename U> inline void amin(T &x, U y) { if(y < x) x = y; }
template<typename T, typename U> inline void amax(T &x, U y) { if(x < y) x = y; }

int main() {
	int N, Seed, X, Y, Z;
	scanf("%d%d%d%d%d", &N, &Seed, &X, &Y, &Z);
	vector<int> A(N);
	A[0] = Seed;
	reu(i, 1, N)
		A[i] = ((ll)X * A[i-1] + Y) % Z;
	const int W = 64;
	typedef unsigned long long Word;
	int B = (N + W - 1) / W * W;
	Word *bits = new Word[B+1], *tmp = new Word[B+1];
	rep(i, B+1) bits[i] = 0;
	rep(i, N)
		bits[i / W] |= Word(A[i] & 1) << (i % W);
	int Q;
	scanf("%d", &Q);
//		rep(i, N) cerr << (bits[i / W] >> (i % W) & 1); cerr << endl;
	rep(i, Q) {
		int S, T, U, V;
		scanf("%d%d%d%d", &S, &T, &U, &V), -- S, -- U;
		int len = T - S;
		{	int i = 0, j = S;
			if(j % W == 0) {
				for(; i + W <= len; i += W, j += W) {
					tmp[i / W] = bits[j / W];
				}
			}else {
				int s = j % W, t = W - s;
				Word cur = bits[j / W], nxt;
				for(; i + W <= len; i += W, j += W) {
					nxt = bits[j / W + 1];
					tmp[i / W] = (cur >> s) | (nxt << t);
					cur = nxt;
				}
			}
			tmp[i / W] = 0;
			for(; i < len; ++ i, ++ j)
				tmp[i / W] |= (bits[j / W] >> (j % W) & 1) << (i % W);
		}
//		rep(i, len) cerr << (tmp[i / W] >> (i % W) & 1); cerr << endl;
		{	int i = 0, k = U;
			if(k % W == 0) {
				for(; i + W <= len; i += W, k += W) {
					bits[k / W] ^= tmp[i / W];
				}
			}else {
				int s = k % W, t = W - s;
				Word cur = tmp[i / W], nxt;
				for(; i + W <= len; i += W, k += W) {
					nxt = tmp[i / W + 1];
					bits[k / W] ^= (cur >> s) | (nxt << t);
					cur = nxt;
				}
			}
			for(; i < len; ++ i, ++ k)
				bits[k / W] ^= (tmp[i / W] >> (i % W) & 1) << (k % W);
		}
//		rep(i, N) cerr << (bits[i / W] >> (i % W) & 1); cerr << endl;
	}
	rep(i, N)
		putchar("EO"[bits[i / W] >> (i % W) & 1]);
	puts("");
	return 0;
}