#pragma GCC optimize ("O3")
#pragma GCC target ("avx") // yukicoder
// #pragma GCC target ("sse4.2") // SPOJ, codechef

#include <cstdio>
#include <cassert>
#include <cmath>
#include <cstring>

#include <algorithm>
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <functional>
#include <tuple>

#define _rep(_1, _2, _3, _4, name, ...) name
#define rep2(i, n) rep3(i, 0, n)
#define rep3(i, a, b) rep4(i, a, b, 1)
#define rep4(i, a, b, c) for (int i = int(a); i < int(b); i += int(c))
#define rep(...) _rep(__VA_ARGS__, rep4, rep3, rep2, _)(__VA_ARGS__)

using namespace std;

using i64 = long long;
using u8 = unsigned char;
using u32 = unsigned;
using u64 = unsigned long long;
using f80 = long double; 

struct fast_div {
  using u128 = __uint128_t;
  fast_div() {}
  fast_div(u64 n) : m(n) {
    s = (n == 1) ? 0 : 127 - __builtin_clzll(n - 1);
    x = ((u128(1) << s) + n - 1) / n;
  }
  friend u64 operator / (u64 n, fast_div d) { return u128(n) * d.x >> d.s; }
  friend u64 operator % (u64 n, fast_div d) { return n - n / d * d.m; }
  u64 m, s, x;
};

void set_bit(u64* a, int i) {
  a[i >> 6] |= u64(1) << (i & 63);
}
void clear_bit(u64* a, int i) {
  a[i >> 6] &= ~(u64(1) << (i & 63));
}
void flip_bit(u64* a, int i) {
  a[i >> 6] ^= u64(1) << (i & 63);
}
bool get_bit(u64* a, int i) {
  return a[i >> 6] & (u64(1) << (i & 63));
}

void init_A(u64* A, int N, int S, int X, int Y, int Z) {
  auto fZ = fast_div(Z);
  rep(i, N) {
    if (S & 1) set_bit(A, i);
    else clear_bit(A, i);
    S = (u64(X) * S + Y) % fZ;
  }
}

#define getchar getchar_unlocked

int get_int() {
  int n; char c;
  while ((c = getchar()) < '0');
  n = c - '0';
  while ((c = getchar()) >= '0') n = n * 10 + c - '0';
  return n;
}

void vec_xor(u64* A, int s, int t, int u, int, u64* B) {
  int q1 = s / 64, r1 = s % 64;
  int q2 = t / 64, r2 = t % 64;
  int q3 = u / 64, r3 = u % 64;

  int beg = q1, end = q2 + (r2 > 0);
  rep(i, beg, end) B[i - beg] = A[i];

  if (r1) B[0] &= ~((u64(1) << r1) - 1);
  if (r2) B[end - beg - 1] &= (u64(1) << r2) - 1;
  B[-1] = B[end - beg] = 0;

  int d = r3 - r1;
  if (d < 0) {
    d = -d;
    rep(i, -1, end - beg) A[q3 + i] ^= (B[i] >> d) | (B[i + 1] << (64 - d));
  } else if (d == 0) {
    rep(i, end - beg) A[q3 + i] ^= B[i];
  } else {
    rep(i, end - beg + 1) A[q3 + i] ^= (B[i] << d) | (B[i - 1] >> (64 - d));
  }
}

const int N_MAX = 2e6;

void print_vec(u64* A, int N) {
  static char ans[N_MAX + 10];
  rep(i, N) ans[i] = get_bit(A, i) ? 'O' : 'E';
  ans[N] = '\0';
  puts(ans);
}

void solve() {
  static u64 A[N_MAX / 64 + 10]; // 
  static u64 B[100000 / 64 + 10];

  int N, S, X, Y, Z;
  while (~scanf("%d %d %d %d %d", &N, &S, &X, &Y, &Z)) {
    init_A(A, N, S, X, Y, Z);
    int Q = get_int();
    rep(_, Q) {
      int s = get_int() - 1;
      int t = get_int();
      int u = get_int() - 1;
      int v = get_int();
      vec_xor(A, s, t, u, v, B + 1);
    }
    print_vec(A, N);
  }
}

int main() {
  clock_t beg = clock();
  solve();
  clock_t end = clock();
  fprintf(stderr, "%.3f sec\n", double(end - beg) / CLOCKS_PER_SEC);
  return 0;
}