#include<bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define vtpl(x,y,z) vector<tuple<x,y,z>>
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[9]={0,1,-1,0,1,1,-1,-1,0};
const ll dx[9]={1,0,0,-1,1,-1,1,-1,0};
template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

using mint=modint998244353;

mint p1,p2,q1,q2;

vector<mint> a(1000010);
vector<mint> dp(1000010);
void induce(ll l,ll mid,ll r){
    vector<mint> ds;
    vector<mint> nds;
    for(ll i=l;i<mid;i++){
        ds.emplace_back(dp[i]);
    }
    for(ll i=0;i<r+1-l;i++){
        nds.emplace_back(a[i]);
    }
    auto ret=convolution(ds,nds);
    mint sum=0;
    ll now=0;
    for(int i=mid;i<r;i++){
        dp[i]+=ret[i-1-l];
    }
    //cout << l << " " << mid << " " << r << endl;
    //rep(i,4)cout << dp[i] <<" ";cout << endl;
}
void dfs(ll l,ll r){
    if(l+1==r){
        //cout << dp[l] << endl;
        dp[l]*=p1;
        dp[l]+=a[l];
        return;
    }
    ll mid=(l+r)/2;
    dfs(l,mid);
    induce(l,mid,r);
    dfs(mid,r);
}
int main(){
	vl hoge(4);rep(i,4)cin >> hoge[i];
    //cin >> p1.val() >> p2.val() >> q1.val() >> q2.val();
    p1=hoge[0];p2=hoge[1];
    q1=hoge[2];q2=hoge[3];
    ll n;cin >> n;
    a[0]=1;
    q1/=q2;
    p1/=p2;
    mint c=1;
    for(ll i=1;i<=n;i++){
        c*=q1;
        a[i]=a[i-1]*c;
    }
    dfs(0,n+1);
    //rep(i,n+1)cout << dp[i] <<" ";cout << endl;
    cout << dp[n].val() << endl;
}