#include <bits/stdc++.h>

using namespace std;
using ll = long long;

const ll modc = 998244353;
class mint {
    ll x;
public:
    mint(ll x=0) : x((x%modc+modc)%modc) {}
    mint operator-() const { return mint(-x);}
    mint& operator+=(const mint& a) {
        if ((x += a.x) >= modc) x -= modc;
        return *this;
    }
    mint& operator-=(const mint& a) {
        if ((x += modc-a.x) >= modc) x -= modc;
        return *this;
    }
    mint& operator*=(const  mint& a) {
        (x *= a.x) %= modc;
        return *this;
    }
    mint operator+(const mint& a) const {
        mint res(*this);
        return res+=a;
    }
    mint operator-(const mint& a) const {
        mint res(*this);
        return res-=a;
    }
    mint operator*(const mint& a) const {
        mint res(*this);
        return res*=a;
    }
    mint pow(ll t) const {
        if (!t) return 1;
        mint a = pow(t>>1);
        a *= a;
        if (t&1) a *= *this;
        return a;
    }
    mint inv() const {return pow(modc-2);}
    mint& operator/=(const mint& a){ return (*this) *= a.inv();}
    mint operator/(const mint& a) const {
        mint res(*this);
        return res/=a;
    }
    bool operator == (const mint& a) const{ return x == a.x;}
    bool operator != (const mint& a) const{ return x != a.x;}
    friend ostream& operator<<(ostream& os, const mint& m){
        os << m.x;
        return os;
    }
    friend istream& operator>>(istream& ip, mint &m) {
        ll t;
        ip >> t;
        m = mint(t);
        return ip;
    }
    ll val(){ return x;}
};

int main(){
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);

    // dp(i, j) : i秒の時点でj秒生きた細胞が幾つ存在するか？
    mint P, Q, x;
    cin >> P >> x;
    P /= x;
    cin >> Q >> x;
    Q /= x;
    int T;
    cin >> T;
    vector<mint> dp(T+1), qp(T+1);
    qp[0] = 1;
    for (int i=1; i<=T; i++) qp[i] = qp[i-1] * Q;
    dp[0] = 1;

    for (int i=1; i<=T; i++){
        vector<mint> pd(T+1);
        for (int j=0; j<i; j++) pd[0] += dp[j] * P;
        for (int j=1; j<=T; j++) pd[j] = dp[j-1] * qp[j];
        swap(dp, pd);
    }

    mint ans = 0;
    for (int i=0; i<=T; i++) ans += dp[i];
    cout << ans << endl;

    return 0;
}