// #define DEBUGGING
#include <bits/stdc++.h>
#define endl '\n'
#define ALL(V) begin(V), end(V)
#define ALLR(V) rbegin(V), rend(V)
using ll = std::int64_t;
using ull = std::uint64_t;
using PLL = std::pair<ll, ll>;
using TLL = std::tuple<ll, ll, ll>;
template <typename T> using V = std::vector<T>;
template <typename T> using VV = V<V<T>>;
template <typename T> const T& var_min(const T &t) { return t; }
template <typename T> const T& var_max(const T &t) { return t; }
template <typename T, typename... Tail> const T& var_min(const T &t, const Tail&... tail) { return std::min(t, var_min(tail...)); }
template <typename T, typename... Tail> const T& var_max(const T &t, const Tail&... tail) { return std::max(t, var_max(tail...)); }
template <typename T, typename... Tail> void chmin(T &t, const Tail&... tail) { t = var_min(t, tail...); }
template <typename T, typename... Tail> void chmax(T &t, const Tail&... tail) { t = var_max(t, tail...); }
template <typename T> const T& clamp(const T &t, const T &low, const T &high) { return std::max(low, std::min(high, t)); }
template <typename T> void chclamp(T &t, const T &low, const T &high) { return t = clamp(t, low, high); }
namespace init__ { struct InitIO { InitIO() { std::cin.tie(nullptr); std::ios_base::sync_with_stdio(false); std::cout << std::fixed << std::setprecision(30); } } init_io; }
#define mv_rec make_v(init, tail...)
template <typename T> T make_v(T init) { return init; }
template <typename T, typename... Tail> auto make_v(T init, size_t s, Tail... tail) { return V<decltype(mv_rec)>(s, mv_rec); }
#undef mv_rec
using namespace std;

#ifdef DEBUGGING
#else
#define DEBUG(...) 0
#define DEBUG_SEPARATOR_LINE 0
#endif

const ll mod = 1e9 + 7;

ll mod_pow(ll n, ll k) {
    ll ret = 1;
    ll cur = n;
    while (k) {
        if (k & 1) ret = ret * cur % mod;
        cur = cur * cur % mod;
        k /= 2;
    }
    return ret;
}

ll mod_inv(ll n) { return mod_pow(n, mod - 2); }

const size_t SIZE = 60;
ll dp[SIZE][2];

int main() {
    ll N, M, K, p, q;
    cin >> N >> M >> K >> p >> q;
    V<ll> B(N);
    for (auto &&e : B) cin >> e;

    ll p1 = p * mod_inv(q) % mod;
    ll p2 = (1 - p1 + mod) % mod;
    dp[0][0] = p2;
    dp[0][1] = p1;
    for (ll i = 1; i < SIZE; i++) {
        for (ll j = 0; j < 2; j++) for (ll k = 0; k < 2; k++) {
            ll nxt = (j + k) % 2;
            (dp[i][nxt] += dp[i - 1][j] * dp[i - 1][k] % mod) %= mod;
        }
    }

    ll cnt[2] = { 1, 0, };
    for (ll i = 0; K; i++, K /= 2) {
        if (!(K & 1)) continue;
        ll ncnt[2] = {};
        for (ll j = 0; j < 2; j++) for (ll k = 0; k < 2; k++) {
            ll nxt = (j + k) % 2;
            (ncnt[nxt] += cnt[j] * dp[i][k] % mod) %= mod;
        }
        cnt[0] = ncnt[0];
        cnt[1] = ncnt[1];
    }

    ll ans = 0;
    for (ll i = 0; i < M; i++) ans += B[i] * cnt[0] % mod;
    for (ll i = M; i < N; i++) ans += B[i] * cnt[1] % mod;
    cout << ans % mod << endl;
    return 0;
}