P1, P2, Q1, Q2, T = map(int, input().split())
mod = 998244353
M = 10 ** 6 + 5
dp = [0] * (T + 1)
dp[0] = 1
prob = [1] * (M + 1)
prob2 = [1] * (T + 1)
inv = pow(Q2, mod - 2, mod)
for i in range(1, M + 1):
    prob[i] = prob[i-1] * Q1 * inv
    prob[i] %= mod
    
for i in range(T + 1):
    for j in range(T - i + 1):
        prob2[i] *= prob[j]
        prob2[i] %= mod

def f(x):
    return x * (x + 1)//2

p = P1 * pow(P2, mod-2, mod) % mod
for i in range(1, T + 1):
    for j in range(i):
        dp[i] += dp[j] * (prob[f(i-j-1)]) * p
        dp[i] %= mod

for i in range(T + 1):
    dp[i] *= prob[f(T-i)]
    dp[i] %= mod
    

print(sum(dp) % mod)