#include <stdio.h>
#include <algorithm>

#define M 1000000007

int n, m;
long long p;
long long V[100000];

long long inv[200001];
long long F[200001];
long long IF[200001];

long long C(int n, int r) {
    return F[n] * IF[n - r] % M * IF[r] % M;
}

long long mpow(long long a, long long b) {
    if (b == 0) return 1;
    if (b % 2 == 1) return a * mpow(a, b - 1) % M;
    return mpow(a * a % M, b / 2);
}

int main(void) {
    inv[1] = 1;
    for (int i = 2; i <= 200000; i++) {
        inv[i] = inv[M % i] * (M - M / i) % M;
    }
    F[0] = 1;
    IF[0] = 1;
    for (int i = 1; i <= 200000; i++) {
        F[i] = i * F[i - 1] % M;
        IF[i] = inv[i] * IF[i - 1] % M;
    }
    scanf("%d %d %lld", &n, &m, &p);
    long long q = (100 - p) * inv[100] % M;
    p = p * inv[100] % M;
    for (int i = 0; i < n; i++) {
        scanf("%lld", V + i);
    }
    std::sort(V, V + n);
    std::reverse(V, V + n);
    long long ans = 0;
    long long s = 0;
    for (int i = 1; i <= n - 1; i++) {
        s = (s + V[i - 1]) % M;
        ans += s * C(m - 1 + i, i) % M * mpow(p, m - 1) % M * mpow(q, i) % M * p % M;
        ans %= M;
    }
    s = (s + V[n - 1]) % M;
    for (int i = 0; i <= m - 1; i++) {
        ans += s * C(n - 1 + i, i) % M * mpow(p, i) % M * mpow(q, n - 1) % M * q % M;
        ans %= M;
    }
    printf("%lld\n", ans);
    return 0;
}