def inv(x):
    return pow(x, MOD-2, MOD)

N, M, P = map(int, input().split())
MOD = 10 ** 9 + 7
fact = [1]

for i in range(1, N+M):
    fact.append(fact[-1] * i % MOD)
    
V = list(map(int, input().split()))
V.sort(reverse=True)
V_acc = [0]

for Vi in V:
    V_acc.append(V_acc[-1] + Vi)

ans = 0
#M個すべてを使い切る時
for i in range(N):
    A = fact[M+i-1] * pow(P, M, MOD) * pow(100-P, i, MOD) * (V_acc[i] - V_acc[0])
    B = fact[i] * fact[M-1] * pow(100, M+i, MOD)
    ans += A * inv(B) % MOD
    ans %= MOD
#M個すべてを使い切らない時
for i in range(M):
    A = fact[N+i-1] * pow(P, i, MOD) * pow(100-P, N, MOD) * (V_acc[N] - V_acc[0])
    B = fact[i] * fact[N-1] * pow(100, N+i, MOD)
    ans += A * inv(B) % MOD
    ans %= MOD

print(ans)