#include <bits/stdc++.h>

#define rep(X,N) for(ll X = 0; X < (N); X++)
#define PI (acos(-1.0))
#define pback push_back
#define mpair make_pair
#define MODN 1000000007
#define ALL(V) (V).begin(),(V).end()
#define CERR if(false) cerr
#define INT_MAX_HALF (INT_MAX / 2)
#define EPS (1e-10)

using namespace std;

typedef long long ll;

class ModInt{
public:
    long long n;
    int p;

    ModInt(){
    }

    //値と割る値を受け取って、オブジェクトを返す
    ModInt(long long _n, int _p){
        p = _p;
        n = _n % _p;

        //負の値を受け取ったときには正の値に戻す
        if(n < 0){
            n += p;
        }
    }

    ModInt operator+(ModInt a){

        ModInt tmp = ModInt(*this);

        tmp.n += a.n;

        if(tmp.n > tmp.p){
            tmp.n -= tmp.p;
        }
        
        return tmp;
    }

    ModInt operator-(ModInt a){

        ModInt tmp = ModInt(*this);

        tmp.n -= a.n;

        if(tmp.n < 0){
            tmp.n += tmp.p;
        }

        return tmp;
    }

    ModInt operator*(ModInt a){

        ModInt tmp = ModInt(*this);

        tmp.n = (tmp.n * a.n) % tmp.p;

        return tmp;
    }

    int modpow(int b, int k){
        if(k == 0){
            return 1;
        }else if(k % 2 == 1){
            long long tmp = b;
            tmp = tmp * modpow(b, k - 1) % p;
            
            return tmp;
        }else{
            long long tmp = modpow(b, k / 2);
            return tmp * tmp % p;
        }
    }

    int modinv(int b){
        return modpow(b, p - 2);
    }

    ModInt operator/(ModInt a){

        ModInt tmp = ModInt(*this);

        tmp.n = tmp.n * modinv(a.n) % tmp.p;
        return tmp;
    }
};

int main(){

    ll n,m,k,p,q;
    cin >> n >> m >> k >> p >> q;

    vector<ll> taste;

    rep(i, n){
        ll b;
        cin >> b;

        taste.pback(b);
    }

    vector<pair<ModInt, ModInt>> pv;

    pv.pback(mpair(ModInt(1, MODN), ModInt(0 , MODN)));
    pv.pback(mpair(ModInt(1, MODN) - ModInt(2, MODN) * ModInt(p, MODN) / ModInt(q, MODN), ModInt(p, MODN) / ModInt(q, MODN)));

    rep(i, ceil(log2(k))){
        ModInt a = pv[i + 1].first;
        ModInt b = pv[i + 1].second;
        pv.pback(mpair(a * a,a * b + b));
    }

    function<ModInt(pair<ModInt, ModInt>, ModInt)> f = [&](pair<ModInt, ModInt> a, ModInt x) ->ModInt{

        return a.first * x + a.second;

    };

    ModInt m_evenp = ModInt(1, MODN);

    while(k > 0){

        ll tmp = floor(log2(k) + EPS);

        cerr << k << " " << tmp << endl;

        if(k == 1){
            m_evenp = f(pv[1], m_evenp);
            break;
        }

        m_evenp = f(pv[tmp + 1], m_evenp);

        k = k - (ll)pow(2.0, tmp);

        
    }

    cerr << m_evenp.n << endl;

    ModInt oddp = ModInt(1, MODN) - m_evenp;

    ModInt ans = ModInt(0, MODN);

    rep(i,m){
        ans = ans + m_evenp * ModInt(taste[i], MODN);
    }

    rep(i, n - m){
        ans = ans + oddp * ModInt(taste[i + m], MODN);
    }

    cout << ans.n << endl;




    
    return 0;
}