#include <bits/stdc++.h>

using namespace std;

using ll = long long;

const ll MOD = 1000000007;

ll modpow(ll x, ll n, ll mod = MOD) {
    ll res = 1;
    while (n > 0) {
        if (n & 1) res = res * x % mod;
        x = x * x % mod;
        n >>= 1;
    }
    return res;
}

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n, m;
    ll K, p, q;
    cin >> n >> m >> K >> p >> q;
    ll a = p * modpow(q, MOD - 2) % MOD;
    ll hoge = (MOD + 1 - 2 * a % MOD) % MOD;
    ll foo = (1 + modpow(hoge, K)) % MOD * ((MOD + 1) / 2) % MOD;
    ll bar = (MOD + 1 - foo) % MOD;
    //cerr << foo << " " << bar << endl;

    ll sum1 = 0, sum2 = 0;
    for (int i = 0; i < n; ++i) {
        ll b;
        cin >> b;
        if (i < m) (sum1 += b) %= MOD;
        else (sum2 += b) %= MOD;
    }
    ll ans = sum1 * foo % MOD + sum2 * bar % MOD;
    ans %= MOD;
    cout << ans << "\n";
    return 0;
}

// 1 + (2 * a - 1)^K