#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<sstream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<climits>
#include<cmath>
#include<string>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<numeric>
#include<functional>
#include<algorithm>
#include<bitset>
#include<tuple>
#include<unordered_set>
#include<unordered_map>
#include<random>
#include<array>
#include<cassert>
using namespace std;
#define INF (1<<29)
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define all(v) v.begin(),v.end()
#define uniq(v) v.erase(unique(all(v)),v.end())

#define MOD 1000000007

#define MAXN 200000
long long inv[MAXN + 1];//MODを法とする乗法の逆元
long long fact[MAXN + 1];//階乗
long long ifact[MAXN + 1];//階乗の逆元
void init() {
	inv[1] = 1;
	for (int i = 2; i <= MAXN; i++) inv[i] = inv[MOD%i] * (MOD - MOD / i) % MOD;
	fact[0] = ifact[0] = 1;
	for (int i = 1; i <= MAXN; i++) {
		fact[i] = i * fact[i - 1] % MOD;
		ifact[i] = ifact[i - 1] * inv[i] % MOD;
	}
}
long long C(int n, int r) {
	if (n < 0 || r < 0 || r > n)return 0;
	if (r > n / 2)r = n - r;
	return fact[n] * ifact[n - r] % MOD*ifact[r] % MOD;
}


int n, m, p;
int v[100000];

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);

	init();

	cin >> n >> m >> p;
	rep(i, n)cin >> v[i];

	sort(v, v + n);
	reverse(v, v + n);
	rep(i, n - 1) (v[i + 1] += v[i]) %= MOD;

	long long suc = 1, fail = 1;
	fail *= p;
	fail %= MOD;
	fail *= inv[100];
	fail %= MOD;
	suc *= 100 - p;
	suc %= MOD;
	suc *= inv[100];
	suc %= MOD;



	long long ans = 0;
	long long sucs = 1, fails = 1;
	rep(i, m) {
		fails *= fail;
		fails %= MOD;
	}
	rep(i, n - 1) {
		sucs *= suc;
		sucs %= MOD;

		ans += v[i] * C(i + 2 + m - 1 - 1, m - 1) % MOD * sucs%MOD * fails%MOD;
		ans %= MOD;
	}

	sucs *= suc;
	sucs %= MOD;
	fails = 1;
	rep(i, m) {
		ans += v[n-1] * C(n + i - 1, i) % MOD * sucs%MOD * fails%MOD;
		ans %= MOD;

		fails *= fail;
		fails %= MOD;
	}


	cout << ans << endl;


	return 0;
}