#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <string>
#include <map>
#include <set>
#include <tuple>
#include <deque>
#include <numeric>
#include <bitset>
#include <iomanip>
#include <cassert>
#include <chrono>
#include <random>
#include <limits>
#include <iterator>
#include <functional>
#include <sstream>
#include <complex>
using namespace std;

typedef long long ll;
typedef pair<int, int> P;
typedef pair<int, double> Pid;
typedef pair<double, int> Pdi;
typedef pair<ll, int> Pl;
typedef pair<int, pair<int, int>> PP;
constexpr double PI = 3.1415926535897932;   // acos(-1)
constexpr double EPS = 1e-15;
constexpr int INF = 1001001001;
constexpr int mod = 1e+9 + 7;

#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define chadd(x, y) x = (x + y) % mod

template<int mod>
struct ModInt{
    int x;

    ModInt() : x(0) {}
    
    ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}
    
    ModInt &operator+=(const ModInt &p){
        if((x += p.x) >= mod)   x -= mod;
        return *this;
    }
    
    ModInt &operator-=(const ModInt &p){
        if((x += mod - p.x) >= mod) x -= mod;
        return *this;
    }

    ModInt &operator*=(const ModInt &p){
        x = (int)(1LL * x * p.x % mod);
        return *this;
    }

    ModInt &operator/=(const ModInt &p){
        *this *= p.inverse();
        return *this;
    }
    
    ModInt operator-() const {return ModInt(-x);}

    ModInt operator+(const ModInt &p) const {return ModInt(*this) += p;}

    ModInt operator-(const ModInt &p) const {return ModInt(*this) -= p;}

    ModInt operator*(const ModInt &p) const {return ModInt(*this) *= p;}

    ModInt operator/(const ModInt &p) const {return ModInt(*this) /= p;}

    bool operator==(const ModInt &p) const {return x == p.x;}

    bool operator!=(const ModInt &p) const {return x != p.x;}

    ModInt inverse() const{
        int a = x, b = mod, u = 1, v = 0, t;
        while(b > 0){
            t = a / b;
            swap(a -= t * b, b);
            swap(u -= t * v, v);
        }
        return ModInt(u);
    }

    ModInt pow(int64_t n) const{
        ModInt ret(1), mul(x);
        while(n > 0){
            if(n & 1)   ret *= mul;
            mul *= mul;
            n >>= 1;
        }
        return ret;
    }

    friend ostream &operator<<(ostream &os, const ModInt &p){
        return os << p.x;
    }

    friend istream &operator>>(istream &is, ModInt &a){
        int64_t t;
        is >> t;
        a = ModInt<mod>(t);
        return (is);
    }

    static int get_MOD() {return mod;}
};

using modint = ModInt<mod>;
using vec = vector<modint>;
using mat = vector<vec>;

mat mul(const mat& A, const mat& B){
    mat res = mat(A.size(), vec(B[0].size(), 0));
    for(int i = 0; i < A.size(); ++i){
        for(int k = 0; k < B.size(); ++k){
            for(int j = 0; j < B[0].size(); ++j){
                res[i][j] += A[i][k] * B[k][j];
            }
        }
    }
    return res;
}

mat pow(mat A, ll n){
    mat res = mat(A.size(), vec(A[0].size(), 0));
    for(int i = 0; i < A.size(); ++i)   res[i][i] = 1;
    while(n > 0){
        if(n & 1)   res = mul(res, A);
        A = mul(A, A);
        n >>= 1;
    }
    return res;
}

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

    int n, m;
    ll k;
    modint p, q;
    cin >> n >> m >> k >> p >> q;
    vector<modint> b(n);
    for(int i = 0; i < n; ++i)  cin >> b[i];
    mat P = mat(2, vec(2));
    P[0][0] = (modint)1 - p * q.inverse();
    P[1][1] = P[0][0];
    P[0][1] = p * q.inverse();
    P[1][0] = P[0][1];
    P = pow(P, k);
    modint p0 = P[0][0];
    modint p1 = P[0][1];
    modint res = 0;
    for(int i = 0; i < n; ++i){
        if(i < m){
            res += b[i] * p0;
        }
        else{
            res += b[i] * p1;
        }
    }
    cout << res << endl;
}