#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
using namespace std;
typedef long long int ll;
ll mod=1e9+7;
ll mod_pow(ll a,ll b){
    a%=mod;
    if(b==0)return 1;
    if(b==1)return a;
    ll res=mod_pow(a,b/2)%mod;
    res*=res; res%=mod;
    if(b%2)res*=a;
    return res%mod;
}

struct perm{
private:
    int sz;
    vector<ll> p,invp;
public:
    perm(int n){
        sz=n+1;
        p.resize(sz),invp.resize(sz);
        p[0]=1;
        for(int i=1;i<=sz-1;i++){
            p[i]=p[i-1]*i%mod;
        }
        invp[sz-1]=mod_pow(p[sz-1],mod-2);
        for(int i=sz-2;i>=0;i--){
            invp[i]=invp[i+1]*(i+1)%mod;
        }
    }
    ll comb(ll x,ll y){
        if(x<y||y<0)return 0;
        return (p[x]*invp[x-y]%mod)*invp[y]%mod;
    }
};
perm p(1<<20);
int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    ll n,m,k,p,q; cin >> n >> m >> k >> p >> q;
    vector<ll> b(n);
    for(int i=0;i<n;i++){
        cin >> b[i];
    }
    ll ans=0;
    ll pp=((q-2*p)%mod+mod);
    pp*=mod_pow(q,mod-2);
    pp%=mod;
    pp=mod_pow(pp,k);
    pp*=mod_pow(2,mod-2);
    pp%=mod;
    for(int i=0;i<m;i++){
        ll p=mod_pow(2,mod-2)+pp;
        p%=mod;
        ans+=p*b[i]%mod;
        ans%=mod;
    }
    for(int i=m;i<n;i++){
        ll p=mod_pow(2,mod-2)-pp;
        p%=mod;
        p+=mod;
        //cout << p << endl;
        ans+=p*b[i]%mod;
        ans%=mod;
    }
    if(ans<0)ans+=mod;
    cout << ans << endl; 
}