#include <atcoder/modint>
#include <iostream>
#include <vector>

using namespace std;
using mint = atcoder::modint998244353;

int main() {
    long long p1, p2, q1, q2, t;
    cin >> p1 >> p2 >> q1 >> q2 >> t;
    mint p = mint(p2).inv() * p1;
    mint q = mint(q2).inv() * q1;

    vector<mint> dp(t + 1);
    dp[0] = 1;
    vector<mint> q_pow(t + 1, 1);
    for (int i = 0; i < t; i++) q_pow[i + 1] = q_pow[i] * q;

    for (int i = 1; i <= t; i++) {
        vector<mint> ndp(t + 1);
        for (int j = 0; j <= t; j++) {
            ndp[0] += dp[j] * p;
        }
        for (int j = 1; j <= t; j++) {
            ndp[j] = dp[j - 1] * q_pow[j];
        }
        swap(dp, ndp);
    }

    mint ans = 0;
    for (int i = 0; i <= t; i++) ans += dp[i];
    cout << ans.val() << endl;
}