#include <bits/stdc++.h>
using namespace std;

template<int m>
struct Mint {
  int v;
  Mint(int _v = 0) : v(_v) { v %= m; adjust(); }
  void adjust() { if (v < 0) v += m; if (v >= m) v -= m; assert(0 <= v && v < m); }
  Mint operator+() const { return *this; }
  Mint operator-() const { Mint r = Mint(0) - *this; return r.adjust(), r; }
  friend Mint operator+(Mint a, Mint b) { a.v += b.v; return a.adjust(), a; }
  Mint& operator+=(const Mint &b) { return v += b.v, adjust(), *this; }
  friend Mint operator-(Mint a, Mint b) { a.v -= b.v; return a.adjust(), a; }
  Mint& operator-=(const Mint &b) { return v -= b.v, adjust(), *this; }
  friend Mint operator*(Mint a, Mint b) { a.v = (int64_t) a.v * b.v % m; return a.adjust(), a; }
  friend Mint operator*(Mint a, int v) { return a * Mint(v); }
  friend Mint operator^(Mint a, int p) {
    int v = a.v;
    int r = 1;
    for (int i = p; i; i >>= 1) {
      if (i & 1) r = (int64_t) r * v % m;
      v = (int64_t) v * v % m;
    }
    return r;
  }
  friend Mint operator^(Mint a, Mint p) { return a^p.v; }
  friend Mint operator/(Mint a, Mint b) { return a * (Mint(b.v)^(m-2)); }
  friend ostream& operator<<(ostream &os, Mint a) { return os << a.v, os; }
};

int main() {
  ios::sync_with_stdio(false);

  int N, M, P; {
    cin >> N >> M >> P;
  }

  vector<int> V(N); {
    for (int i = 0; i < N; ++i) cin >> V[i];
    sort(V.begin(), V.end());
    reverse(V.begin(), V.end());
  }

  const int MOD = 1e9 + 7;

  vector<Mint<MOD>> fac(N + M + 1); {
    fac[0] = Mint<MOD>(1);
    for (int i = 1; i <= N + M; ++i) fac[i] = fac[i - 1] * i;
  }

  vector<Mint<MOD>> ifac(N + M + 1); {
    ifac[N + M] = Mint<MOD>(1) / fac[N + M];
    for (int i = N + M; i; --i) ifac[i - 1] = ifac[i] * i;
  }

  auto binomial = [&](int n, int m) { return fac[n] * ifac[m] * ifac[n - m]; };

  Mint<MOD> res; {
    Mint<MOD> p_fail = Mint<MOD>(P) / Mint<MOD>(100) ^ M;
    Mint<MOD> p_succ(1);
    Mint<MOD> p_sum;
    for (int i = 0; i < N; ++i) {
      p_sum = p_sum + binomial(M - 1 + i, M - 1) * p_succ * p_fail;
      p_succ = p_succ * (Mint<MOD>(100 - P) / Mint<MOD>(100));
      res = res + (Mint<MOD>(1) - p_sum) * V[i];
    }
  }

  cout << res << endl;
}