#include <stdio.h>
#include <algorithm>
using namespace std;

const long long mod = 1000000007;
int N,M,P,V[100100];
long long inv[200100]={0,1},fact[200100]={1,1},ifact[200100]={1,1};

int main()
{
	for (int i=2;i<200100;i++){
		inv[i] = (mod - mod / i) * inv[mod % i] % mod;
		fact[i] = fact[i-1] * i % mod;
		ifact[i] = ifact[i-1] * inv[i] % mod;
	}

	scanf ("%d %d %d",&N,&M,&P); P = P * inv[100] % mod;

	for (int i=0;i<N;i++) scanf ("%d",&V[i]);
	sort(V,V+N);
	reverse(V,V+N);

	long long ans = 0, sum = 1, have = 0, pw = 1, mul = 1;
	for (int i=1;i<=M;i++) mul = mul * P % mod;
	for (int i=0;i<=N;i++){
		long long c = pw * fact[i+M-1] % mod * ifact[M-1] % mod * ifact[i] % mod * mul % mod;
		ans = (ans + c * have) % mod;
		sum = (sum + mod - c) % mod;
		have = (have + V[i]) % mod;
		pw = pw * (mod + 1 - P) % mod;
	}
	ans = (ans + sum * have) % mod;
	printf ("%lld\n",ans);

	return 0;
}