#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
int n, m;
int fac[100005], ifac[100005];
int sl[2][1505], ssl[1505];
int pr[2][1505], ppr[1505];
int g[1505], sg[1505], sm[1505];
inline int fpm(int x, int y) {
  int re = 1;
  while (y) {
    if (y & 1) re = 1LL * re * x % mod;
    x = 1LL * x * x % mod, y >>= 1;
  }
  return re;
}
inline int Sub(int a, int b) { return (a -= b) < 0 ? a + mod : a; }
inline int Add(int a, int b) { return (a += b) > mod ? a - mod : a; }
inline int perm(int n, int k) { return 1LL * fac[n] * ifac[n - k] % mod; }
inline int comb(int n, int k) { return 1LL * perm(n, k) * ifac[k] % mod; }
void getProb() {
  int a, b, t;
  scanf("%d %d %d", &a, &b, &t);
  fac[0] = 1;
  for (int i = 1; i <= t; ++i) fac[i] = 1LL * i * fac[i - 1] % mod;
  ifac[t] = fpm(fac[t], mod - 2);
  for (int i = t; i; --i) ifac[i - 1] = 1LL * i * ifac[i] % mod;
  int p = 1LL * a * fpm(b, mod - 2) % mod, q = 1 + mod - p;
  for (int i = 0; i <= min(t, m); ++i)
    g[i] = 1LL * comb(t, i) * fpm(p, i) % mod * fpm(q, t - i) % mod;
}
int main() {
  scanf("%d %d", &n, &m);
  getProb();
  int u = 0, v = 1;
  sl[u][1] = pr[u][m] = 1;
  for (int o = 1; o <= n; ++o) {
    for (int i = m; i >= 1; --i) ssl[i] = Add(sl[u][i], ssl[i + 1]);
    for (int i = 1; i <= m; ++i) ppr[i] = Add(pr[u][i], ppr[i - 1]);
    for (int i = m; i >= 1; --i) {
      sg[i] = Add(sg[i + 1], g[m - i]);
      sm[i] = Add(sm[i + 1], 1LL * ssl[i + 1] * g[m - i] % mod);
      sl[v][i] = 1LL * g[i - 1] *
                 Sub(1LL * sg[i] * Sub(ssl[1], ppr[i - 1]) % mod, sm[i]) % mod;
    }
    for (int i = 1; i <= m; ++i) {
      sg[i] = Add(sg[i - 1], g[i - 1]);
      sm[i] = Add(sm[i - 1], 1LL * ppr[i - 1] * g[i - 1] % mod);
      pr[v][i] = 1LL * g[m - i] *
                 Sub(1LL * sg[i] * Sub(ppr[m], ssl[i + 1]) % mod, sm[i]) % mod;
    }
    swap(u, v);
  }
  int ans = 0;
  for (int i = 1; i <= m; ++i) ans = Add(ans, sl[u][i]);
  printf("%d\n", ans);
  return 0;
}
