#include <bits/stdc++.h>
using namespace std;
#include <atcoder/modint>
using mint = atcoder::modint998244353;

int main() {
    int p1, p2, q1, q2, t;
    cin >> p1 >> p2 >> q1 >> q2 >> t;
    vector dp(t + 1, vector<mint> (t + 1));
    mint p = mint(p1) / p2;
    mint q = mint(q1) / q2;
    dp[0][0] = 1;
    for (int i = 0; i < t; i++) {
        mint sm = 0;
        for (int j = 0; j <= i; j++) {
            sm += dp[i][j];
        }
        dp[i + 1][0] = sm * p;
        for (int j = 0; j <= i; j++) {
            dp[i + 1][j + 1] = q.pow(j + 1) * dp[i][j];
        }
    }
    mint ans = 0;
    for (int j = 0; j <= t; j++) ans += dp[t][j];
    cout << ans.val() << endl;
}