#include <bits/stdc++.h>
#define rep(i,n) for(int i=(0);i<(n);i++)

using namespace std;

typedef long long ll;

const ll MOD = 1e9 + 7;

typedef vector<vector<ll>> mat;

void print(mat A){
	rep(i, A.size()){
		rep(j, A[i].size()){
			cout << A[i][j] << (j == A[i].size()-1 ? "\n" : " ");
		}
	}
}

mat mmul(mat A, mat B){
	int n = A.size();
	int l = A[0].size();
	int m = B[0].size();
	mat C(n, vector<ll>(m, 0));
	for(int i = 0; i < n; i++){
		for(int j = 0; j < m; j++){
			for(int k = 0; k < l; k++){
				C[i][j] += A[i][k] * B[k][j];
				C[i][j] %= MOD;
			}
		}
	}

	return C;
}

mat mE(int n){
	mat A(n, vector<ll>(n, 0));
	for(int i = 0; i < n; i++){
		A[i][i] = 1LL;
	}

	return A;
}

mat mpow(mat A, ll x){
	int n = A.size();
	if(x == 0) return mE(n);
	if(x % 2 == 1) return mmul(A, mpow(A, x - 1));

	mat B = mpow(A, x / 2);
	return mmul(B, B);
}

// pow
ll pow(ll a, ll b){
	if(b == 0) return 1;
	if(b & 1) {
		return a * pow(a, b - 1);
	} else {
	ll d = pow(a, b / 2);
	return d * d;
	}
}

// mod calc

ll powmod(ll a, ll b){
	if(b == 0) return 1;
	if(b & 1) {
		return a * powmod(a, b - 1) % MOD;
	} else {
		ll d = powmod(a, b / 2) % MOD;
		return d * d % MOD;
	}
}

ll sub(ll a, ll b){
	return a + MOD - b;
}

ll inv(ll a){
	return powmod(a, MOD - 2);
}


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

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

	vector<ll> b(n);
	rep(i, n) cin >> b[i];

	mat a(2, vector<ll>(2));
	a[0][0] = 1 + MOD - (p * inv(q)) % MOD;
	a[0][0] %= MOD;

	a[0][1] = (p * inv(q)) % MOD;
	a[1][0] = a[0][1];
	a[1][1] = a[0][0];

	mat c = mpow(a, k);
	ll x = c[0][0];
	ll y = c[0][1];

	ll ans = 0;
	for(int i = 0; i < m; i++){
		ans += x * b[i] % MOD;
		ans %= MOD;
	}

	for(int i = m; i < n; i++){
		ans += y * b[i] % MOD;
		ans %= MOD;
	}

	cout << ans << endl;
}