#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <cassert>
#include <iostream>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <utility>
#include <numeric>
#include <algorithm>
#include <bitset>
#include <complex>
#include <cstdint>
#include <unordered_set>
#include <unordered_map>

using namespace std;

typedef long long Int;
typedef vector<int> vint;
typedef pair<int, int> pint;
#define mp make_pair

template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <typename T> void pv(T a, T b) { for (T i = a; i != b; ++i) cout << *i << " "; cout << endl; }
template <typename T> void chmin(T &t, const T &f) { if (t > f) t = f; }
template <typename T> void chmax(T &t, const T &f) { if (t < f) t = f; }
int in() { int x; scanf("%d", &x); return x; }


int N;
Int S, X, Y, Z;
int Q;

char ans[2000010];

uint64_t MASKS[110];
uint64_t a[100010];

void generate() {
	Int s = S;
	for (int i = 0; i < N; ++i) {
		if (s & 1) {
			a[i >> 6] |= 1ULL << (i & 63);
		}
		s = (X * s + Y) % Z;
	}
}

int main() {
	MASKS[0] = 0;
	for (int d = 1; d <= 64; ++d) {
		MASKS[d] = MASKS[d - 1] << 1 | 1;
	}
	
	for (; ~scanf("%d%lld%lld%lld%lld", &N, &S, &X, &Y, &Z); ) {
#ifdef LOCAL
		memset(a, 0, sizeof(a));
#endif
		generate();
		for (Q = in(); Q--; ) {
			const int s = in() - 1;
			const int t = in();
			const int u = in() - 1;
			const int v = in();
			for (int p = s, q = u, d; p < t && q < v; p += d, q += d) {
				d = min({ t - p, v - q, 64 - (p & 63), 64 - (q & 63) });
				a[q >> 6] ^= ((a[p >> 6] >> (p & 63)) & MASKS[d]) << (q & 63);
			}
		}
		for (int i = 0; i < N; ++i) {
			ans[i] = "EO"[(a[i >> 6] >> (i & 63)) & 1];
		}
		ans[N] = '\0';
		puts(ans);
	}
	
	return 0;
}