import java.io.BufferedReader
import java.io.InputStream
import java.io.InputStreamReader
import java.util.*
import kotlin.math.abs
import kotlin.math.max
import kotlin.math.min

val MOD = 1_000_000_007

class Solver(stream: InputStream, private val out: java.io.PrintWriter) {
  fun solve() {
    val N = ni()
    val M = ni()
    val K = nl()
    val P = ni()
    val Q = ni()
    val B = na(N).map{it.toLong()}
    val revQ = powMod(Q, (MOD - 2).toLong(), MOD).toInt()
    val move = P.toLong()
    val remain = ((MOD + Q - P) % MOD).toLong()
    debug{"revQ:$revQ move:$move remain:$remain"}

    val a = arrayOf(
      longArrayOf(remain, move),
      longArrayOf(move, remain)
    )
    val cnt0 = B.take(M).sum() % MOD
    val cnt1 = B.drop(M).sum() % MOD
    val init = arrayOf(
      longArrayOf(cnt0),
      longArrayOf(cnt1)
    )
    val b = powMat(a, K, MOD)
    val res = mulMat(b, init, MOD)
    debugDim(res)
    val ans = res[0][0] * powMod(revQ, K, MOD) % MOD
    out.println(ans)
  }

  fun powMod(a: Int, n: Long, mod: Int): Long {
    if (n == 0L) return 1
    val res = powMod((a.toLong() * a % mod).toInt(), n / 2, mod)
    return if (n % 2 == 1L) res * a % mod else res
  }

  fun powMat(a: Array<LongArray>, n: Long, mod: Int): Array<LongArray> {
    if (n == 1L) return a
    val res = powMat(mulMat(a, a, mod), n / 2, mod)
    return if (n % 2 == 1L) mulMat(res, a, mod) else res
  }

  fun mulMat(a: Array<LongArray>, b: Array<LongArray>, mod: Int): Array<LongArray> {
    assert(a[0].size == b.size)
    val len = a[0].size
    val h = a.size
    val w = b[0].size
    val res = Array(h){LongArray(w)}
    val th = 7e18.toLong()
    for (i in 0 until h) {
      for (j in 0 until w) {
        var v = 0L
        for (k in 0 until len) {
          v += a[i][k] * b[k][j]
          if (v > th) v %= mod
        }
        res[i][j] = if (v >= mod) v % mod else v
      }
    }
    return res
  }










































  private val isDebug = try {
    // なんか本番でエラーでる
    System.getenv("MY_DEBUG") != null
  } catch (t: Throwable) {
    false
  }

  private var tokenizer: StringTokenizer? = null
  private val reader = BufferedReader(InputStreamReader(stream), 32768)
  private fun next(): String {
    while (tokenizer == null || !tokenizer!!.hasMoreTokens()) {
      tokenizer = StringTokenizer(reader.readLine())
    }
    return tokenizer!!.nextToken()
  }

  private fun ni() = next().toInt()
  private fun nl() = next().toLong()
  private fun ns() = next()
  private fun na(n: Int, offset: Int = 0): IntArray {
    return map(n, offset) { ni() }
  }

  private inline fun map(n: Int, offset: Int = 0, f: (Int) -> Int): IntArray {
    val res = IntArray(n)
    for (i in 0 until n) {
      res[i] = f(i + offset)
    }
    return res
  }

  private inline fun debug(msg: () -> String) {
    if (isDebug) System.err.println(msg())
  }

  private fun debug(a: LongArray) {
    debug { a.joinToString(" ") }
  }

  private fun debug(a: IntArray) {
    debug { a.joinToString(" ") }
  }

  private fun debug(a: BooleanArray) {
    debug { a.map { if (it) 1 else 0 }.joinToString("") }
  }

  private fun debugDim(A: Array<LongArray>) {
    if (isDebug) {
      for (a in A) {
        debug(a)
      }
    }
  }

  /**
   * 勝手にimport消されるのを防ぎたい
   */
  private fun hoge() {
    min(1, 2)
    max(1, 2)
    abs(-10)
  }
}

fun <A, B> pair(a: A, b: B) = RPair(a, b)
data class RPair<A, B>(val _1: A, val _2: B)

fun main() {
  val out = java.io.PrintWriter(System.out)
  Solver(System.`in`, out).solve()
  out.flush()
}