#include <bits/stdc++.h>

#include <atcoder/modint>
using namespace std;
using mint = atcoder::modint998244353;
void fast_io() {
    ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
}

int main() {
    fast_io();
    int pp1, pp2, qq1, qq2, t;
    cin >> pp1 >> pp2 >> qq1 >> qq2 >> t;
    mint p = mint(pp1) / pp2, q = mint(qq1) / qq2;
    vector<mint> birth(t + 2), remain(t + 2);
    birth[0] = 1;
    for (int i = 1; i <= t + 1; i++) {
        for (int j = 0; j < i; j++) {
            remain[i] += birth[j] * q.pow((i - 1 - j) * (i - j) / 2);
        }
        birth[i] = remain[i] * p;
    }
    cout << remain[t + 1].val() << endl;
}