#include <cassert>
#include <algorithm>
#include <array>
#include <bitset>
#include <cctype>
#include <cstdint>
#include <cmath>
#include <complex>
#include <chrono>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#include <random>
#include <memory>
#include <utility>
#include <limits>
#include "limits.h"
 
#define rep(i, a, b) for (long long i = (a); (i) < (b); (i)++)
#define all(i) i.begin(), i.end()
#define debug(...) std::cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)

void debug_out(){std::cerr<<std::endl;}

template<typename Head,typename... Tail>
void debug_out(Head h,Tail... t){
  std::cerr<<" "<<h;
  debug_out(t...);
}
 
template <typename T1, typename T2>
std::ostream& operator<<(std::ostream& os, std::pair<T1, T2> pa) {
  return os << pa.first << " " << pa.second;
}
 
template <typename T>
std::ostream& operator<<(std::ostream& os, std::vector<T> vec) {
  for (int i = 0; i < vec.size(); i++)os << vec[i] << (i + 1 == vec.size() ? "" : " ");
  return os;
}
 
template<typename T1,typename T2>
inline bool chmax(T1& a,T2 b){return a<b && (a=b,true);}
 
template<typename T1,typename T2>
inline bool chmin(T1& a,T2 b){return a>b && (a=b,true);}
 
long long pow_mod(long long a, long long b, long long mod=-1) {
  if(b==0)return 1;
  if ((a == 0)||(mod!=-1&&(a+mod)%mod==0)) {
    return 0;
  }
  long long x = 1;
  while (b > 0) {
    if (b & 1) {
      x = (mod!=-1)?(x * a) % mod:x*a;
    }
    a = (mod!=-1)?(a * a) % mod:a*a;
    b >>= 1;
  }
  return x;
}

// const long long MOD = 998244353;
const long long MOD = 1e9 + 7;

using ll = long long;
using P=std::pair<long long,long long>;

using mat=std::vector<std::vector<ll>>;
 
mat Mul(mat a,mat b,ll mod){
  assert(a[0].size()==b.size());
 
  mat ret(a.size(),std::vector<ll>(b[0].size()));
 
  for(ll i=0;i<a.size();i++){
    for(ll j=0;j<b[0].size();j++){
      ll temp=0;
      for(ll k=0;k<a[0].size();k++){
        temp=(temp+a[i][k]*b[k][j])%mod;
      }
      ret[i][j]=temp;
    }
  }
 
  return ret;
}
 
//非再帰累乗(mod付き)
mat pow_mod(mat a, ll b, ll mod=-1) {
  ll n=a.size();
 
  mat x(n,std::vector<ll>(n,0));
 
  rep(i,0,n)x[i][i]=1;
 
  while (b > 0) {
    if (b & 1) {
      x = Mul(x,a,mod);
    }
    a =Mul(a,a,mod);
    b >>= 1;
  }
  return x;
}

int main() {
  std::cin.tie(nullptr);
  std::ios::sync_with_stdio(false);

  ll n,m,k;
  std::cin>>n>>m>>k;

  ll p,q;
  std::cin>>p>>q;

  std::vector<ll> b(n);
  rep(i,0,n)std::cin>>b[i];

  ll milk=0,kit=0;
  rep(i,0,n){
    if(i<m){
      milk+=b[i];
      milk%=MOD;
    }else{
      kit+=b[i];
      kit%=MOD;
    }
  }

  mat a=std::vector<std::vector<ll>>(2,std::vector<ll>(2));

  a[0][0]=(q-p)*pow_mod(q,MOD-2,MOD)%MOD;
  a[0][1]=p*pow_mod(q,MOD-2,MOD)%MOD;
  a[1][0]=a[0][1];
  a[1][1]=a[0][0];

  a=pow_mod(a,k,MOD);

  std::cout<<(a[0][0]*milk%MOD+a[0][1]*kit%MOD)%MOD<<"\n";

  return 0;
}