n = 205050
mod = 10 ** 9 + 7
fact = [1] * (n + 1)
invfact = [1] * (n + 1)
for i in range(1, n):
    fact[i + 1] = ((i+1) * fact[i]) % mod
invfact[n] = pow(fact[n], mod - 2, mod)
for i in range(n - 1, -1, -1):
    invfact[i] = invfact[i + 1] * (i + 1) % mod

def comb(n, r):
    if n < 0 or r < 0 or n - r < 0:
        return 0
    return fact[n] * invfact[r] * invfact[n - r] % mod

N, M, P = map(int, input().split())
V = list(map(int, input().split()))
V.sort(reverse=True)
Vc = [0] * (N + 1)
for i in range(N):
    Vc[i + 1] = Vc[i] + V[i]

ans = 0
P = P * pow(100, mod - 2, mod) % mod
nokori = 1
for i in range(N):
    ans += Vc[i] * pow(P, M, mod) * pow(1 - P, i, mod) * comb(M + i - 1, i)
    ans %= mod
    nokori -= pow(P, M, mod) * pow(1 - P, i, mod) * comb(M + i - 1, i)
    nokori %= mod

ans += Vc[-1] * nokori
ans %= mod

print(ans)