#include <bits/stdc++.h>

using namespace std;

using ll = long long;

const ll MOD = 1000000007;

ll modpow(ll x, ll n, ll mod = MOD) {
    ll res = 1;
    while (n > 0) {
        if (n & 1) res = res * x % mod;
        x = x * x % mod;
        n >>= 1;
    }
    return res;
}

ll f[200005], fi[200005];

ll comb(int r, int c) {
    if (r < c) return 0;
    return f[r] * fi[c] % MOD * fi[r - c] % MOD;
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n, m, p;
    cin >> n >> m >> p;

    vector<ll> v(n);
    for (int i = 0; i < n; i++) cin >> v[i];
    sort(v.rbegin(), v.rend());

    vector<ll> sum(n + 1, 0);
    for (int i = 1; i <= n; i++) {
        sum[i] = sum[i - 1] + v[i - 1];
    }

    f[0] = 1;
    for (int i = 1; i <= n + m; i++) {
        f[i] = f[i - 1] * i % MOD;
    }
    fi[n + m] = modpow(f[n + m], MOD - 2);
    for (int i = n + m; i > 0; i--) {
        fi[i - 1] = fi[i] * i % MOD;
    }

    ll inv100 = modpow(100, MOD - 2);
    ll hoge = modpow(p * inv100 % MOD, m);
    ll foo = 1;
    ll per_n = 1;
    ll ans = 0;
    for (int i = 0; i < n; i++) {
        ll tmp = comb(i + m - 1, m - 1) * hoge % MOD * foo % MOD;
        (per_n += MOD - tmp) %= MOD;
        (ans += tmp * sum[i] % MOD) %= MOD;
        (foo *= (100 - p) * inv100 % MOD) %= MOD;
    }
    (ans += per_n * sum[n] % MOD) %= MOD;
    cout << ans << endl;
    return 0;
}