import std.stdio, std.string, std.conv, std.range;
import std.algorithm, std.array, std.typecons, std.container;
import std.math, std.numeric, std.random, core.bitop;

enum inf = 1_001_001_001;
enum infl = 1_001_001_001_001_001_001L;
enum mod = 1_000_000_007L;

void main() {
    int N, M; long K;
    int p, q;
    scan(N, M, K, p, q);
    auto b = iota(N).map!(i => readln.chomp.to!long).array;

    auto y = 2 * p % mod * pow(q, mod - 2) % mod; // 2p / q;
    auto x = 1 - y;
    if (x < 0) x += mod;
    x = pow(x, K);
    auto prk = 1 - x;
    if (prk < 0) prk += mod;
    prk = prk * pow(2, mod - 2) % mod;

    long ans;

    foreach (i ; 0 .. N) {
        if (i < M) {
            auto pp = 1 - prk;
            if (pp < 0) pp += mod;
            (ans += pp * b[i] % mod) %= mod;
        }
        else {
            (ans += prk * b[i] % mod) %= mod;
        }
    }

    writeln(ans);
}


long pow(long x, long y) {
    return y > 0 ? pow(x, y >> 1)^^2 % mod * x^^(y & 1) % mod : 1L;
}




void scan(T...)(ref T args) {
    import std.stdio : readln;
    import std.algorithm : splitter;
    import std.conv : to;
    import std.range.primitives;

    auto line = readln().splitter();
    foreach (ref arg; args) {
        arg = line.front.to!(typeof(arg));
        line.popFront();
    }
    assert(line.empty);
}

void fillAll(R, T)(ref R arr, T value) {
    static if (is(typeof(arr[] = value))) {
        arr[] = value;
    }
    else {
        foreach (ref e; arr) {
            fillAll(e, value);
        }
    }
}

bool chmin(T, U...)(ref T x, U args) {
    bool isChanged;

    foreach (arg; args) {
        if (x > arg) {
            x = arg;
            isChanged = true;
        }
    }

    return isChanged;
}

bool chmax(T, U...)(ref T x, U args) {
    bool isChanged;

    foreach (arg; args) {
        if (x < arg) {
            x = arg;
            isChanged = true;
        }
    }

    return isChanged;
}