MOD = 10 ** 9 + 7
D = 2
def mt(A, B):
    C = [[0] * D for _ in range(D)]
    for i in range(D):
        for j in range(D):
            tmp = 0
            for k in range(D):
                tmp += A[i][k] * B[k][j]
                tmp %= MOD
            C[i][j] = tmp
    return C

N, M, K, P, Q = map(int, input().split())
B = [int(input()) for _ in range(N)]
a = 0
b = 0
for i in range(N):
    if i < M:
        a += B[i]
    else:
        b += B[i]


move = (P * pow(Q, -1, MOD)) % MOD
notmove = (1 - move) % MOD

A = [[notmove,move],[move,notmove]]
X = [[1,0],[0,1]]
while K > 0:
    if K & 1:
        X = mt(A,X)
    A = mt(A,A)
    K >>= 1
ans = (X[0][0] * a + X[0][1] * b) % MOD
print(ans)