n,s,x,y,z = map(int,input().split())
M = 10**5
dp = [0]*21
a = s
idx = cnt = 0
for i in range(n):
    dp[idx] |= (a%2)<<cnt
    a = (a*x+y)%z
    cnt += 1
    if cnt == M:
        idx += 1
        cnt = 0

def show(dp):
    s = ""
    for i in range(n):
        t = bin(dp[i])[2:][::-1]
        s += t + "0"*(M-len(t))
    return s[:n]

q = int(input())
for _ in range(q):
    s,t,u,v = map(int,input().split())
    s -= 1; t -= 1; u -= 1; v -= 1
    si,sj = s//M, s%M
    ti,tj = t//M, t%M
    if si==ti:
        x = (dp[si]>>sj)&((1<<(tj-sj+1))-1)
    else:
        x = (dp[si]>>sj) | ((dp[ti]&((1<<(tj+1))-1))<<(M-sj))
    #show(dp)
    #print(s,t,bin(x)[2:][::-1],u,v)
    ui,uj = u//M, u%M
    vi,vj = v//M, v%M
    if ui == vi:
        dp[ui] ^= x << uj
    else:
        dp[ui] ^= (x&((1<<(M-uj))-1)) << uj
        dp[vi] ^= x >> (M-uj)

print("".join("O" if i=="1" else "E" for i in show(dp)))