#include<iostream>
#include<algorithm>
using namespace std;
long mod=1e9+7,v[1<<17];
int n,m,p;
long power(long a,long b){return b?power(a*a%mod,b/2)*(b%2?a:1)%mod:1;}
main()
{
	cin>>n>>m>>p;
	for(int i=0;i<n;i++)cin>>v[i];
	sort(v,v+n,greater<long>());
	long sumv=0,sump=0,C=1,ans=0;
	for(int k=0;k<n;k++)
	{
		long nowp=power(100-p,k)*power(p,m)%mod*C%mod*power(power(100,m+k),mod-2)%mod;
		sump=(sump+nowp)%mod;
		ans=(ans+nowp*sumv%mod)%mod;
		sumv=(sumv+v[k])%mod;
		C=C*(m+k)%mod*power(k+1,mod-2)%mod;
	}
	ans=(ans+(1-sump+mod)%mod*sumv%mod)%mod;
	cout<<ans<<endl;
}