#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cmath>
using namespace std;
using ll = long long;

constexpr int P = 1000000007;

ll powmod(ll n, ll k) {
    ll r = 1, t = n % P;
    for (; k != 0; k /= 2) {
        if (k & 1) r = r * t % P;
        t = t * t % P;
    }
    return r;
}
ll inv(ll n) {
    return powmod(n, P - 2);
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);

    int n, m;
    cin >> n >> m;

    ll k;
    cin >> k;
    
    int p, q;
    cin >> p >> q;

    ll h = inv(2);
    ll x = (P + 1 - p * inv(q) % P * 2 % P) % P;
    x = (h * powmod(x, k) + h) % P;
    ll y = (P + 1 - x) % P;

    ll r = 0;
    for (int i = 0; i < n; i++) {
        ll b;
        cin >> b;

        ll t = i < m ? b * x : b * y;
        r += t % P;
    }

    cout << r % P << endl;

    return 0;
}