#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<utility>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<functional>
#include<math.h>
#include<random>
#include <bitset>
using namespace std;
#define N (1000000000+7)
//#define N 998244353
#define INF 1e16
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> Q;
typedef vector<ll> vec;
typedef vector<vec> mat;

const int inf = (int)1e9; 

ll inv(ll x,ll power) {
	ll res = 1;
	ll k = power;
	ll y = x%N;
	while (k) {
		if (k & 1)res = (res*y) % N;
		y = (y%N*y%N) % N;
		k /= 2;
	}
	return res;
}

int main(void){
	ll n,m,k,p,q;
	cin>>n>>m>>k>>p>>q;
	ll ans = 0;
	ll invtwo = inv(2LL,N-2);
	ll haha = (q-2*p+N)%N;
	haha = (haha+N)%N;
	haha = inv(haha,k);
	ll child = inv(q,k);
	child = inv(child,N-2);
	for(int i=1;i<=n;i++){
		ll b;
		cin>>b;
		if(i<=m){
			ll t = (haha*invtwo)%N;
			t = (t*child)%N;
			t = (t+invtwo)%N;
			ans = (ans+(t*b)%N)%N;
		}
		else{
			ll t = (haha*invtwo)%N;
			t = (t*child)%N;
			t = -t;
			t = (t+N)%N;
			t = (t+invtwo)%N;
			ans = (ans+(t*b)%N)%N;
		}
	}
	cout<<ans<<endl;
	return 0;
}