def mod_inv(n: int, mod: int) -> int:
    return pow(n, mod-2, mod)


MOD = 998244353
P1, P2, Q1, Q2, T = map(int, input().split())

p = P1 * mod_inv(P2, MOD) % MOD
q = Q1 * mod_inv(Q2, MOD) % MOD

dp = [0] * (T+1)
dp[0] = 1
for i in range(T):
    pp = [0] * (T+1)
    dp, pp = pp, dp
    # 新たに生成
    dp[0] = p * sum(pp) % MOD

    # 生存
    for j in range(T):
        dp[j+1] = pow(q, j+1, MOD) * pp[j] % MOD

ans = sum(dp) % MOD
print(ans)