#include <bits/stdc++.h>
using namespace std;
inline long long read() {
  char c = getchar();
  long long x = 0;
  bool f = 0;
  for (; !isdigit(c); c = getchar()) f ^= !(c ^ 45);
  for (; isdigit(c); c = getchar()) x = (x << 1) + (x << 3) + (c ^ 48);
  if (f) x = -x;
  return x;
}
struct modint {
  long long x;
  modint(long long o = 0) { x = o; }
  modint &operator=(long long o) { return x = o, *this; }
  modint &operator+=(modint o) {
    return x = x + o.x >= 1000000007 ? x + o.x - 1000000007 : x + o.x, *this;
  }
  modint &operator-=(modint o) {
    return x = x - o.x < 0 ? x - o.x + 1000000007 : x - o.x, *this;
  }
  modint &operator*=(modint o) { return x = 1ll * x * o.x % 1000000007, *this; }
  modint &operator^=(long long b) {
    modint a = *this, c = 1;
    for (; b; b >>= 1, a *= a)
      if (b & 1) c *= a;
    return x = c.x, *this;
  }
  modint &operator/=(modint o) { return *this *= o ^= 1000000007 - 2; }
  modint &operator+=(long long o) {
    return x = x + o >= 1000000007 ? x + o - 1000000007 : x + o, *this;
  }
  modint &operator-=(long long o) {
    return x = x - o < 0 ? x - o + 1000000007 : x - o, *this;
  }
  modint &operator*=(long long o) {
    return x = 1ll * x * o % 1000000007, *this;
  }
  modint &operator/=(long long o) {
    return *this *= ((modint(o)) ^= 1000000007 - 2);
  }
  template <class I>
  friend modint operator+(modint a, I b) {
    return a += b;
  }
  template <class I>
  friend modint operator-(modint a, I b) {
    return a -= b;
  }
  template <class I>
  friend modint operator*(modint a, I b) {
    return a *= b;
  }
  template <class I>
  friend modint operator/(modint a, I b) {
    return a /= b;
  }
  friend modint operator^(modint a, long long b) { return a ^= b; }
  friend bool operator==(modint a, long long b) { return a.x == b; }
  friend bool operator!=(modint a, long long b) { return a.x != b; }
  bool operator!() { return !x; }
  modint operator-() { return x ? 1000000007 - x : 0; }
};
long long n, m, k;
modint x, p[1505], sump[1505], fr[1505][1505], s[1505][1505], tmp[1505][1505];
modint fac[1000005], iv[1000005];
void pre(long long n) {
  fac[0] = iv[0] = 1;
  for (register long long i = (1); i <= (n); ++i)
    fac[i] = fac[i - 1] * i, iv[i] = iv[i - 1] / i;
}
inline modint C(long long n, long long m) { return fac[n] * iv[m] * iv[n - m]; }
signed main() {
  n = read(), m = read(), x = read(), x /= read(), k = read();
  pre(1e6);
  for (register long long i = (0); i <= (min(m, k)); ++i)
    p[i] = C(k, i) * (x ^ i) * ((-x + 1) ^ (k - i));
  for (register long long i = (1); i <= (m); ++i)
    sump[i] = sump[i - 1] + p[i - 1];
  fr[0][m] = s[0][m] = 1;
  for (register long long i = (1); i <= (n); ++i)
    for (register long long r = (1); r <= (m); ++r) {
      fr[i][r] = p[m - r] *
                 (sump[r] * (s[i - 1][m] - s[i - 1][m - r]) - tmp[i - 1][r]);
      s[i][r] = s[i][r - 1] + fr[i][r];
      tmp[i][r] = tmp[i][r - 1] + p[r - 1] * s[i][r - 1];
    }
  cout << s[n][m].x;
  return 0;
}
