#include <bits/stdc++.h>
using namespace std;

template<int m>
struct Mint {
  int v;
  Mint(int _v = 0) : v(_v) { v %= m; adjust(); }
  void adjust() { if (v < 0) v += m; if (v >= m) v -= m; assert(0 <= v && v < m); }
  Mint operator+() const { return *this; }
  Mint operator-() const { Mint r = Mint(0) - *this; return r.adjust(), r; }
  friend Mint operator+(Mint a, Mint b) { a.v += b.v; return a.adjust(), a; }
  Mint& operator+=(const Mint &b) { return v += b.v, adjust(), *this; }
  friend Mint operator-(Mint a, Mint b) { a.v -= b.v; return a.adjust(), a; }
  Mint& operator-=(const Mint &b) { return v -= b.v, adjust(), *this; }
  friend Mint operator*(Mint a, Mint b) { a.v = (int64_t) a.v * b.v % m; return a.adjust(), a; }
  friend Mint operator/(Mint a, Mint b) {
    int u = 1;
    for (int i = m - 2; i; i >>= 1) {
      if (i & 1) u = (int64_t) u * b.v % m;
      b.v = (int64_t) b.v * b.v % m;
    }
    return a * Mint(u);
  }
  friend ostream& operator<<(ostream &os, Mint a) { return os << a.v, os; }
};

template<typename T>
struct Matrix {
  vector<vector<T>> dat;
  Matrix(int n, int m) : dat(n, vector<T>(m)) {}
  Matrix(vector<vector<T>> d) : dat(d) {}
  friend Matrix operator*(Matrix a, Matrix b) {
    Matrix r(a.dat.size(), b.dat[0].size());
    for (int i = 0; i < a.dat.size(); ++i) {
      for (int j = 0; j < b.dat[0].size(); ++j) {
        for (int k = 0; k < b.dat.size(); ++k) {
          r.dat[i][j] = a.dat[i][k] * b.dat[k][j] + r.dat[i][j];
        }
      }
    }
    return r;
  }
  friend Matrix operator^(Matrix a, int64_t p) {
    Matrix r(a.dat.size(), a.dat.size());
    for (int i = 0; i < a.dat.size(); ++i) r.dat[i][i] = T(1);
    for (int64_t i = p; i; i >>= 1) {
      if (i & 1) r = r * a;
      a = a * a;
    }
    return r;
  }
};

int main() {
  ios::sync_with_stdio(false);

  int N, M;
  int64_t K;
  int P, Q;
  cin >> N >> M >> K >> P >> Q;

  vector<int> B(N); { for (int i = 0; i < N; ++i) cin >> B[i]; }

  const int MOD = 1e9 + 7;

  Mint<MOD> res(0); {
    for (int i = 0; i < N; ++i) {
      Matrix<Mint<MOD>> v(2, 1); {
        v.dat[0] = { Mint<MOD>(i <  M ? B[i] : 0) };
        v.dat[1] = { Mint<MOD>(M <= i ? B[i] : 0) };
      }
      Matrix<Mint<MOD>> a({
        { Mint<MOD>(Q - P) / Mint<MOD>(Q), Mint<MOD>(P) / Mint<MOD>(Q) }, 
        { Mint<MOD>(P) / Mint<MOD>(Q), Mint<MOD>(Q - P) / Mint<MOD>(Q) }
      });
      Matrix<Mint<MOD>> x = (a^K) * v;
      res = res + x.dat[0][0];
    }
  }

  cout << res << endl;
}