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

const int64_t MOD = 1e9+7;
void add(int64_t& a, int64_t b){
    a = (a+b) % MOD;
}
void mul(int64_t& a, int64_t b){
    a = a*b % MOD;
}

int64_t extgcd(int64_t a, int64_t b, int64_t& x, int64_t& y){
    int64_t d = a;
    if(b != 0){
        d = extgcd(b, a%b, y, x);
        y -= (a/b) * x;
    }else{
        x = 1; y = 0;
    }
    return d;
}

int64_t inv_mod(int64_t a){
    int64_t x, y;
    extgcd(a, MOD, x, y);
    return (MOD + x%MOD) % MOD;
}

typedef vector<vector<int64_t>> Mat;

Mat matmul(Mat A, Mat B){
    assert(A[0].size() == B.size());
    int N = A.size(), M = B[0].size(), K = B.size();
    Mat ans(N, vector<int64_t>(M));
    for(int i=0; i<N; i++) for(int j=0; j<M; j++) for(int k=0; k<K; k++) add(ans[i][j], A[i][k] * B[k][j]);
    return ans;
}

int main(){
    int64_t N, M, K, P, Q;
    cin >> N >> M >> K >> P >> Q;
    int64_t change = P*inv_mod(Q) % MOD;
    int64_t stay = (MOD + 1 - change) % MOD;
    Mat X = {{stay, change}, {change, stay}};
    Mat A = {{1, 0}, {0, 1}};
    while(K > 0){
        if(K%2) A = matmul(X, A);
        X = matmul(X, X);
        K /= 2;
    }

    int64_t ans = 0;
    for(int i=0; i<N; i++){
        int64_t b;
        cin >> b;
        if(i < M){
            add(ans, A[0][0]*b);
        }else{
            add(ans, A[0][1]*b);
        }
    }
    cout << ans << endl;
    return 0;
}