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


def calc(x,y):
    ans = [[0]*2 for i in range(2)]
    for i in range(2):
        for j in range(2):
            for t in range(2):
                ans[i][j] += x[i][t]*y[t][j]
                ans[i][j] %= mod
    return ans


base = [[1,0],[0,1]]
invq = pow(q,mod-2,mod)

A = [[(q-p)*invq%mod,p*invq%mod],[p*invq%mod,(q-p)*invq%mod]]
while k:
    if k & 1:
        base = calc(A,base)
    k >>= 1
    A = calc(A,A)
ans = 0
for i,b in enumerate(B):
    if i < m:
        ans += b*base[0][0]
    else:
        ans += b*base[0][1]
    ans %= mod
print(ans)