// #pragma GCC optimize ("Ofast")
// #pragma GCC optimize ("unroll-loops")
// #pragma GCC target ("avx,avx2,fma")
#include <bits/stdc++.h>

using std::cin, std::cout, std::cerr;
using ll = long long;

const ll P = 1e9 + 7;
ll Pow(ll a, ll b) {
    ll r = 1;
    for(; b; b /= 2) {
        if(b & 1)
            r = r * a % P;
        a = a * a % P;
    }
    return r;
}
ll Inv(ll x) { return Pow(x, P - 2); }

std::pair<ll, ll> Merge(std::pair<ll, ll> a, std::pair<ll, ll> b) {
    return {(a.first * b.first + a.second * b.second) % P,
        (a.first * b.second + a.second * b.first) % P};
}

std::pair<ll, ll> Pow(std::pair<ll, ll> a, ll b) {
    std::pair<ll, ll> r = {1, 0};
    for(; b; b /= 2) {
        if(b & 1)
            r = Merge(r, a);
        a = Merge(a, a);
    }
    return r;
}

int main() {
    std::ios::sync_with_stdio(false);
    ll k, p, q; int n, m;
    cin >> n >> m >> k >> p >> q;
    
    p = p * Inv(q) % P;
    auto [a, b] = Pow({P + 1 - p, p}, k);
    ll ans = 0;
    for(int i = 1; i <= n; i ++) {
        ll x; cin >> x;
        if(i <= m) {
            ans += a * x;
        } else {
            ans += b * x;
        }
        ans %= P;
    }
    cout << ans << '\n';
}