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

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

vector<mint> inv(vector<mint> &F) {
    int n          = F.size();
    vector<mint> G = {mint(1) / F[0]};
    int l          = 1;
    while (l < n) {
        vector<mint> tmp = G;
        for (int i = 0; i < l; i++) {
            tmp[i] *= 2;
        }
        l <<= 1;
        G = atcoder::convolution(G, G);
        vector<mint> tmp2;
        if (n >= l) {
            tmp2 = atcoder::convolution(vector<mint>({F.begin(), F.begin() + l}), G);
        } else {
            tmp2 = atcoder::convolution(F, G);
        }
        G.assign(l, 0);
        for (int i = 0; i < l; i++) {
            if (i < tmp.size()) G[i] += tmp[i];
            if (i < tmp2.size()) G[i] -= tmp2[i];
        }
    }
    G.resize(n);
    return G;
}

int main() {
    long long 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;
    }

    vector<mint> F(T + 2, 0);
    mint alive = 1;
    for (int i = 1; i < T + 2; i++) {
        F[i] = alive * p;
        alive *= powQ[i];
    }
    F[0] = 1;
    for (int i = 1; i < T + 2; i++) {
        F[i] = -F[i];
    }
    auto G   = inv(F);
    mint ans = p == 0 ? 0 : G[T + 1] / p;
    cout << ans.val() << endl;
}