#include #include using namespace std; using mint = atcoder::modint1000000007; int main(){ ios::sync_with_stdio(false); cin.tie(0); int n, m, p; cin >> n >> m >> p; vector a(n); for(auto &&v : a) cin >> v; vector fact(n + m), inv(n + m); fact[0] = 1; for(int i = 1; i < n + m; i++) fact[i] = i * fact[i - 1]; inv.back() = 1 / fact.back(); for(int i = inv.size() - 1; i >= 1; i--) inv[i - 1] = i * inv[i]; mint ans, s, rem, P = mint(100 - p) / 100, coef = (1 - P).pow(m--); sort(a.rbegin(), a.rend()); for(int i = 0; i < n; i++){ mint tmp = fact[m + i] * inv[i] * coef; ans += tmp * s; rem += tmp; coef *= P; s += a[i]; } ans *= inv[m]; ans += (1 - rem * inv[m]) * s; cout << ans.val() << '\n'; }