#include <bits/stdc++.h>
using namespace std;

#include "atcoder/modint.hpp"
using mint = atcoder::modint998244353;

int main() {
    int p1, p2, q1, q2, T;
    cin >> p1 >> p2 >> q1 >> q2 >> T;
    mint p = mint(p1) / p2;
    mint q = mint(q1) / q2;
    vector<mint> powQ(T + 1, 1);
    for (int i = 1; i <= T; i++) {
        powQ[i] = powQ[i - 1] * q;
    }

    if (p == 0) {
        mint ans = 1;
        for (int i = 1; i <= T; i++) {
            ans *= powQ[i];
        }
        cout << ans.val() << endl;
        return 0;
    }

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