#include <iostream>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define MOD 1000000007LL

P mproduct(P m1, P m2) {
  ll x1 = m1.first, y1 = m1.second;
  ll x2 = m2.first, y2 = m2.second;
  m1.first = (x1 * x2 % MOD + y1 * y2 % MOD) % MOD;
  m1.second = (x1 * y2 % MOD + x2 * y1 % MOD) % MOD;
  return m1;
}

P mpow(P m, ll n) {
  P res = P(1, 0);
  while (n) {
    if (n & 1) res = mproduct(res, m);
    m = mproduct(m, m);
    n >>= 1;
  }
  return res;
}

ll pow(ll a, ll n) {
  ll res = 1;
  while (n) {
    if (n & 1) res = res * a % MOD;
    a = a * a % MOD;
    n >>= 1;
  }
  return res;
}

int main() {
  int N, M; cin >> N >> M;
  ll K, p, q; cin >> K >> p >> q;
  ll tea = 0, kitchen = 0;
  for (int i = 0; i < N; i++) {
    int b; cin >> b;
    if (i < M) tea += b;
    else kitchen += b;
  }
  tea %= MOD;
  kitchen %= MOD;

  P m = mpow(P(q - p, p), K);
  ll res = (m.first*tea%MOD + m.second*kitchen%MOD) % MOD;
  cout << res * pow(pow(q, K), MOD-2) % MOD << endl;
}