#Combinationクラス
class Combination:
    '''
    計算量：階乗・逆元テーブルの作成O(N)
            nCkを求めるO(1)
    '''

    def __init__(self, n, MOD):
        self.fact = [1]
        for i in range(1, n + 1):
            self.fact.append(self.fact[-1] * i % MOD)
        self.inv_fact = [pow(self.fact[i] ,MOD - 2 ,MOD) for i in range(n + 1)]
        self.MOD = MOD

    def factorial(self, k):
        '''k!を求める'''
        return self.fact[k]

    def inverse_factorial(self, k):
        '''k!の逆元を求める'''
        return self.inv_fact[k]

    def combination(self, k, r):
        '''kCrを求める'''
        return (self.fact[k] * self.inv_fact[k - r] * self.inv_fact[r]) % self.MOD


n, m, p = map(int, input().split())
v = list(map(int, input().split()))
MOD = 10**9 + 7
comb = Combination(m+n, MOD)

point = [0]*(n+1)
v = sorted(v, reverse = True)
for i in range(n):
    point[i+1] = point[i] + v[i]


li_100 = [1]*(m+n+1)
li_p = [1]*(m+n+1)
li_100_p = [1]*(m+n+1)

for i in range(m+n):
    li_100[i+1] = li_100[i]*100
    li_p[i+1] = li_p[i]*p
    li_100_p[i+1] = li_100[i]*(100-p)
    li_100[i+1] %= MOD
    li_p[i+1] %= MOD
    li_100_p[i+1] %= MOD

b = (li_100[m] * li_100[m] * li_100[n]) % MOD
a = 0
kakuritu = 0

# 0~n-1匹の金魚をすくったとき
for i in range(n):
    kakuritu += li_100[m+n-i] * li_p[m] * li_100_p[i] * comb.combination(m-1+i, i)
    a += li_100[m+n-i] * li_p[m] * li_100_p[i] * point[i] * comb.combination(m-1+i, i)
    a %= MOD
    kakuritu %= MOD

#n匹の金魚をすくったとき
a += (b - kakuritu) * point[n]
a = a % MOD

print((a * pow(b ,MOD-2 , MOD)) % MOD)