#include <bits/stdc++.h>

using namespace std;

using int64 = long long;

template< int mod >
struct Combination {
  vector< int64_t > mfact, rfact;

  Combination(int sz) : mfact(sz + 1), rfact(sz + 1) {
    mfact[0] = 1;
    for(int i = 1; i < mfact.size(); i++) {
      mfact[i] = mfact[i - 1] * i % mod;
    }
    rfact[sz] = inv(mfact[sz]);
    for(int i = sz - 1; i >= 0; i--) {
      rfact[i] = rfact[i + 1] * (i + 1) % mod;
    }
  }

  int64_t fact(int k) const {
    return (mfact[k]);
  }

  int64_t pow(int64_t x, int64_t n) const {
    int64_t ret = 1;
    while(n > 0) {
      if(n & 1) (ret *= x) %= mod;
      (x *= x) %= mod;
      n >>= 1;
    }
    return (ret);
  }

  int64_t inv(int64_t x) const {
    return (pow(x, mod - 2));
  }

  int64_t P(int n, int r) const {
    if(r < 0 || n < r) return (0);
    return (mfact[n] * rfact[n - r] % mod);
  }

  int64_t C(int p, int q) const {
    if(q < 0 || p < q) return (0);
    return (mfact[p] * rfact[q] % mod * rfact[p - q] % mod);
  }

  int64_t H(int n, int r) const {
    if(n < 0 || r < 0) return (0);
    return (r == 0 ? 1 : C(n + r - 1, r));
  }
};


const int mod = 1e9 + 7;

int main() {
  int N, M, P, V[100001] = {};

  cin >> N >> M >> P;
  for(int i = 1; i <= N; i++) cin >> V[i];
  sort(V + 1, V + N + 1, greater< int >());
  for(int i = 1; i <= N; i++) (V[i] += V[i - 1]) %= mod;


  Combination< mod > uku(N + M + 10);

  vector< int64 > f(N + 2);
  int64 P1 = (1LL * P * uku.inv(100)) % mod;
  int64 P2 = (1 + mod - P1) % mod;

  int64 add = 0;
  for(int i = 1; i <= N; i++) {
    f[i] = 1LL;
    (f[i] *= uku.C(i + M - 2, i - 1)) %= mod;
    (f[i] *= uku.pow(P1, M)) %= mod;
    (f[i] *= uku.pow(P2, i - 1)) %= mod;
    (add += f[i]) %= mod;
  }
  f[N + 1] = (1 + mod - add) % mod;

  int64 ret = 0;
  for(int i = 1; i <= N + 1; i++) {
    (ret += V[i - 1] * f[i] % mod) %= mod;
  }
  cout << ret << endl;
}