from functools import cache
import sys
sys.setrecursionlimit(10**6)


def mod_inv(n: int, mod: int) -> int:
    return pow(n, mod-2, mod)


MOD = 10**9 + 7
N, M, P = map(int, input().split())
V = list(map(int, input().split()))
V.sort()


inv = mod_inv(100, MOD)
p = (100 - P) * inv  # 成功
q = P * inv          # 失敗


# @cache
memo = {}
def f(n, m) -> int:
    if n == 0 or m == 0: return 0

    if (n, m) in memo: return memo[n, m]

    res = p * (f(n-1, m) + V[n-1]) + q * (f(n, m-1) + 0)
    res %= MOD
    memo[n, m] = res
    return res


ans = f(N, M)
print(ans)