#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #define rep(i, n) for (int i = 0; i < int(n); i++) using namespace std; long long MOD = 1000000007; long long INF = 1000000000000000; //10^15 typedef long long ll; typedef unsigned long long ull; ll powMod(ll x, ll n, ll mod) { if (n == 0) return 1LL; ll t = powMod(x, n/2, mod); t *= t; t %= mod; if (n & 1) return x * t % mod; return t; } int main(void) { int n, m; ll k, p, q; ll b[100100]; cin >> n >> m >> k >> p >> q; rep(i, n) cin >> b[i]; ll x = 0, y = 0; rep(i, m) x += b[i]; rep(i, n) x += b[i]; y -= x; x %= MOD; y %= MOD; ll s, t; s = powMod(q, k, MOD); t = powMod(q-2LL*p, k, MOD); ll u, v; // u/v u = (x * ((s + t) % MOD) % MOD + y * ((s - t) % MOD) % MOD) % MOD; v = 2LL * s % MOD; cout << u * powMod(v, MOD - 2LL, MOD) % MOD << endl; return 0; }