#include<bits/stdc++.h>
//ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
//clock_t start=clock();clock_t end=clock();cout<<(double)(end-start)/CLOCKS_PER_SEC<<endl;
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int ui;
typedef pair<int,int> pii;
typedef pair<pii,int> ppii;
typedef pair<int,pii> pipi;
typedef pair<ll,ll> pll;
typedef pair<pll,ll> ppll;
typedef pair<ll,pll> plpl;
typedef tuple<ll,ll,ll> tl;
ll mod=1000000007;
ll mod2=998244353;
ll mod3=1000003;
ll mod4=998244853;
ll inf=1LL<<60;
double pi=3.141592653589793238462643383279L;
double eps=1e-10;
#define rep(i,m,n) for(ll i=m;i<n;i++)
#define rrep(i,n,m) for(ll i=n;i>=m;i--)
#define srep(itr,st) for(auto itr=st.begin();itr!=st.end();itr++)
int dh[4]={1,-1,0,0};
int dw[4]={0,0,1,-1};
int ddh[8]={-1,-1,-1,0,0,1,1,1};
int ddw[8]={-1,0,1,-1,1,-1,0,1};
ll gcd(ll a,ll b){
    if(a<b)swap(a,b);
    if(b==0)return a;
    if(a%b==0)return b;
    return gcd(b,a%b);
}
ll Pow(ll n,ll k){
    ll ret=1;
    ll now=n;
    while(k>0){
        if(k&1)ret*=now;
        now*=now;
        k/=2;
    }
    return ret;
}
ll beki(ll n,ll k,ll md){
  ll ret=1;
  ll now=n;
  while(k>0){
    if(k%2==1){
      ret*=now;
      ret%=md;
    }
    now*=now;
    now%=md;
    k/=2;
  }
  return ret;
}
ll gyaku(ll n,ll md){
  return beki(n,md-2,md);
}

vector<vector<ll>> matmul(vector<vector<ll>> a,vector<vector<ll>> b){
    ll n=a.size();
    vector<vector<ll>> ret;
    vector<ll> e;
    rep(i,0,n)e.push_back(0);
    rep(i,0,n)ret.push_back(e);
    rep(i,0,n){
        rep(j,0,n){
            ll sum=0;
            rep(k,0,n){
                sum+=(a[i][k]*b[k][j])%mod;
                sum%=mod;
            }
            ret[i][j]=sum;
        }
    }
    return ret;
}
vector<vector<ll>> matbeki(vector<vector<ll>> a,ll n){
    vector<vector<ll>> ret;
    ll m=a.size();
    vector<ll> e;
    rep(i,0,m)e.push_back(0);
    rep(i,0,m)ret.push_back(e);
    rep(i,0,m){
        rep(j,0,m){
            if(i==j)ret[i][j]=1;
            else ret[i][j]=0;
        }
    }
    
    while(n>0){
        if(n%2){
            ret=matmul(ret,a);
            
        }
        a=matmul(a,a);
        n/=2;
    }
    return ret;
}
int main(){
    ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    ll n,m,k,p,q;cin>>n>>m>>k>>p>>q;
    ll b[n];
    rep(i,0,n)cin>>b[i];
    m--;
    vector<vector<ll>> v(2,vector<ll>(2,0));
    ll r=p*gyaku(q,mod)%mod;
    ll rr=1-r+mod;
    rr%=mod;
    v[0][0]=rr;v[0][1]=r;v[1][0]=r;v[1][1]=rr;
    vector<vector<ll>> ans=matbeki(v,k);
    ll anss=0;
    rep(i,0,n){
        if(i<=m){
            anss+=(ans[1][1]*b[i])%mod;
            anss%=mod;
        }
        else{
            anss+=(ans[1][0]*b[i])%mod;
            anss%=mod;
        }
    }
    cout<<anss<<endl;
}