#include <bits/stdc++.h>
using namespace std;
using lint = long long;
const lint mod = 1e9 + 7;
#define all(x) (x).begin(), (x).end()

lint power(lint base, lint exponent, lint module){
    if(exponent % 2){
        return power(base, exponent - 1, module) * base % module;
    }else if(exponent){
        lint root_ans = power(base, exponent / 2, module);
        return root_ans * root_ans % module;
    }else{
        return 1;
    }
}

int main(){
    int N, M;
    lint K;
    cin >> N >> M >> K;
    lint p, q;
    cin >> p >> q;
    lint r = p * power(q, mod - 2, mod) % mod;
    
    lint milk_tea = 0;
    for(int i = 0; i < M; i++){
        lint b;
        cin >> b;
        milk_tea += b;
    }
    milk_tea %= mod;
    lint kitchen = 0;
    for(int i = 0; i < N - M; i++){
        lint b;
        cin >> b;
        kitchen += b;
    }
    kitchen %= mod;
    
    lint probability_milk = (1 + power((1 - r * 2 + mod * 2) % mod, K, mod)) * 500000004ll % mod;
    lint probability_kitchen = (1 - power((1 - r * 2 + mod * 2) % mod, K, mod) + mod) * 500000004ll % mod;
    cout << (milk_tea * probability_milk % mod + kitchen * probability_kitchen % mod) % mod << endl;
}