from collections.abc import Iterable


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


def accum_dp1(xs: Iterable, f, op, e, size: int, init: Iterable, *, is_reset=True):
    dp = [e] * size
    for i, v in init:
        dp[i] = v

    for x in xs:
        pp = [e] * size if is_reset else dp.copy()
        dp, pp = pp, dp
        for i in range(size):
            for p, v in f(i, pp[i], x):
                if not (0 <= p < size): continue
                dp[p] = op(dp[p], v)

    return dp


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


def f(i, v, x):
    res = []
    # 新たに誕生
    res.append((0, p * v))
    # 生存
    res.append((i+1, pow(q, i+1, MOD) * v))

    return res


def op(a, b):
    return a + b


dp = accum_dp1(range(T), f, op, 0, T+1, [(0, 1)])
ans = sum(dp) % MOD
print(ans)