#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(x) (x).begin(), (x).end()
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
const ll inf = 1e9;

const int mod = 1000000007;
struct mint {
  ll x; // typedef long long ll;
  mint(ll x=0):x((x%mod+mod)%mod){}
  mint operator-() const { return mint(-x);}
  mint& operator+=(const mint a) {
    if ((x += a.x) >= mod) x -= mod;
    return *this;
  }
  mint& operator-=(const mint a) {
    if ((x += mod-a.x) >= mod) x -= mod;
    return *this;
  }
  mint& operator*=(const mint a) { (x *= a.x) %= mod; return *this;}
  mint operator+(const mint a) const { return mint(*this) += a;}
  mint operator-(const mint a) const { return mint(*this) -= a;}
  mint operator*(const mint a) const { return mint(*this) *= a;}
  mint pow(ll t) const {
    if (!t) return 1;
    mint a = pow(t>>1);
    a *= a;
    if (t&1) a *= *this;
    return a;
  }

  // for prime mod
  mint inv() const { return pow(mod-2);}
  mint& operator/=(const mint a) { return *this *= a.inv();}
  mint operator/(const mint a) const { return mint(*this) /= a;}
};
istream& operator>>(istream& is, mint& a) { return is >> a.x;}
ostream& operator<<(ostream& os, const mint& a) { return os << a.x;}

int main() {
  int n,m;
  mint p;
  cin>>n>>m>>p;
  p=p/100;
  vi v(n);
  rep(i,n) cin>>v[i];
  sort(v.rbegin(),v.rend());
  mint ans;
  mint q=mint(1)-p;
  mint a=p.pow(m);
  mint b(1);
  mint c(1);
  mint s;
  mint rp(1);
  rep(i,n){
    ans+=a*b*c*s;
    rp-=a*b*c;
    b*=q;
    c=c*(m+i)/(i+1);
    s+=v[i];
    // cout<<"a "<<a<<" b "<<b<<" c "<<c<<" s "<<s<<" rp "<<rp<<endl;
  }
  ans+=rp*s;
  cout<<ans<<endl;
  return 0;
}