MOD = 10 ** 9 + 7

n, m, p = map(int, input().split())

l = max(n + m, 100)
fact = [1 for _ in range(l + 1)]
inv = [1 for _ in range(l + 1)]
ifact = [1 for _ in range(l + 1)]
for x in range(2, l + 1):
  fact[x] = (fact[x - 1] * x) % MOD
  inv[x] = (- (MOD // x) * inv[MOD % x]) % MOD
  ifact[x] = (ifact[x - 1] * inv[x]) % MOD

v = list(map(int, input().split()))
v.sort(reverse=True)

s = [0 for _ in range(n + 1)]
for i in range(n):
  s[i + 1] = (s[i] + v[i]) % MOD

pm = pow(p * inv[100], m, MOD)
prob = [0 for _ in range(n + 2)]
v = (100 - p) * inv[100] % MOD
cur = 1
for i in range(1, n + 1):
	prob[i] = fact[i + m - 2] * ifact[i - 1] * ifact[m - 1] % MOD
	prob[i] = (prob[i] * pm * cur) % MOD
	cur = (cur * v) % MOD

prob[n + 1] = (1 - sum(prob) % MOD) % MOD

ans = 0
for i in range(1, n + 2):
  ans = (ans + prob[i] * s[i - 1]) % MOD

print(ans)