def _mul(A, B, MOD):
    C = [[0] * len(B[0]) for i in range(len(A))]
    for i in range(len(A)):
        for k in range(len(B)):
            for j in range(len(B[0])):
                C[i][j] = (C[i][j] + A[i][k]*B[k][j]) % MOD
    return C


def pow_matrix(A, n, MOD):
    """A**nをダブリングによって求める"""
    B = [[0] * len(A) for i in range(len(A))]
    for i in range(len(A)):
        B[i][i] = 1
    while n > 0:
        if n & 1:
            B = _mul(A, B, MOD)
        A = _mul(A, A, MOD)
        n  = n // 2
    return B

n, m, k, p, q = list(map(int, input().split()))
b = [int(input()) for i in range(n)]
MOD = 10**9 + 7

milk = sum(b[0:m])
kitchen = sum(b[m:n])

pq = p * pow(q, MOD - 2, MOD) % MOD
qpq = (q-p) * pow(q, MOD - 2, MOD) % MOD
A = [[qpq, pq], [pq, qpq]]
matrix = pow_matrix(A, k, MOD)

ans = milk * matrix[0][0] + kitchen * matrix[0][1]
print(ans % MOD)