using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;

class Program
{
    static int NN => int.Parse(ReadLine());
    static int[] NList => ReadLine().Split().Select(int.Parse).ToArray();
    public static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var c = NList;
        var (p1, p2, q1, q2, t) = (c[0], c[1], c[2], c[3], c[4]);
        var mod = 998_244_353;
        var p2rev = Exp(p2, mod - 2, mod);
        var q2rev = Exp(q2, mod - 2, mod);
        var prob = new long[t + 1];
        prob[0] = 1;
        prob[1] = q1 * q2rev % mod;
        for (var i = 2; i <= t; ++i)
        {
            prob[i] = prob[i - 1] * prob[1] % mod;
        }
        var dp = new long[t + 1];
        dp[0] = 1;
        for (var i = 0; i < t; ++i)
        {
            var ndp = new long[t + 1];
            for (var j = 0; j < t; ++j)
            {
                ndp[j + 1] = dp[j] * prob[j + 1] % mod;
                ndp[0] = (ndp[0] + dp[j] * p1 % mod * p2rev % mod) % mod;
            }
            dp = ndp;
        }
        var ans = 0L;
        for (var i = 0; i < dp.Length; ++i) ans = (ans + dp[i]) % mod;
        WriteLine(ans);
    }
    static long Exp(long n, long p, int mod)
    {
        long _n = n % mod;
        var _p = p;
        var result = 1L;
        if ((_p & 1) == 1) result *= _n;
        while (_p > 0)
        {
            _n = _n * _n % mod;
            _p >>= 1;
            if ((_p & 1) == 1) result = result * _n % mod;
        }
        return result;
    }
}