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

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

int main() {
    int 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> q_pow(1500000, 1);
    for (int i = 1; i < (int)q_pow.size(); i++) {
        q_pow[i] = q_pow[i - 1] * q;
    }

    vector<mint> dp(t + 1);
    dp[0] = 1;
    for (int i = 1; i <= t; i++) {
        for (int j = 0; j < i; j++) {
            dp[i] += dp[j] * q_pow[(i - j) * (i - j - 1) / 2] * p;
        }
    }
    mint ans = 0;
    for (int i = 0; i <= t; i++) {
        ans += dp[i] * q_pow[(t - i) * (t - i + 1) / 2];
    }
    cout << ans.val() << endl;
}