#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<bitset>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<deque>
#include<list>
#include<iomanip>
#include<cmath>
#include<cstring>
#include<functional>
#include<cstdio>
#include<cstdlib>
#include<unordered_map>
#include<unordered_set>
using namespace std;

#define repr(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repr(i, 0, n)
#define INF 2e9
#define MOD 1000000007
//#define MOD 998244353
#define LINF (long long)4e18
#define jck 3.141592
#define PI acos(-1.0);

const double EPS = 1e-10;

using ll = long long;
using Pi = pair<int,int>;
using Pl = pair<ll,ll>;

ll modpow(ll a, ll n, ll m){
    if(n == 0) return 1;
    ll half = modpow(a,n/2,m);
    ll res = half * half % m;
    if(n & 1) res = res * (a%m) % m;
    return res;
}

ll modinv(ll a, ll m) {
    ll b = m, u = 1, v = 0;
    while (b) {
        ll t = a / b;
        a -= t * b; swap(a, b);
        u -= t * v; swap(u, v);
    }
    u %= m;
    if (u < 0) u += m;
    return u;
}


int main(){
	ll N,M,K,p,q; cin >> N >> M >> K >> p >> q;
	vector<ll> b(N);
	rep(i,N) cin >> b[i];
	ll ans = 0;
	rep(i,N){
	    ll now;
		if(i <= M-1){
			now = ((1+modpow(((q-2*p)*modinv(q,MOD)%MOD+MOD)%MOD,K,MOD))%MOD+MOD)%MOD*modinv(2,MOD)%MOD;
		}
		else{
			now = ((1-modpow(((q-2*p)*modinv(q,MOD)%MOD+MOD)%MOD,K,MOD))%MOD+MOD)%MOD*modinv(2,MOD)%MOD;
		}
		ans += now*b[i]%MOD;
		ans %= MOD;
	}
	cout << ans << endl;

}