#include <stdio.h>
#include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
using namespace atcoder;
using mint = modint998244353;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf32 1000000001
#define Inf64 4000000000000000001

mint dp[1000005];
mint p,q;

void dfs(int l,int r){
	if(r-l<=1)return;

	int m = (l+r)/2;
	dfs(l,m);
	vector<mint> x(m-l);
	rep(i,m-l){
		x[i] = dp[l+i];
	}
	vector<mint> y(r-l+2);
	{
		mint cur = 1;
		rep(i,y.size()-1){
			cur *= q.pow(i);
			y[i+1] = cur * p;
		}
	}
	
	x = convolution(x,y);
	rep(i,x.size()){
		if(l+i>=m && l+i<r){
			dp[l+i] += x[i];
		}
	}
	
	dfs(m,r);
}

int main(){
	
	ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	
	{
		int p1,p2;
		cin>>p1>>p2;
		p = p1;
		p /= p2;
	}
	{
		int q1,q2;
		cin>>q1>>q2;
		q = q1;
		q /= q2;
	}
	
	int T;
	cin>>T;
	dp[0] = 1;
	dfs(0,T+2);
	/*
	vector<mint> dp(T+1);
	dp[0] = 1;
	for(int i=1;i<=T;i++){
		mint sum = 1;
		for(int j=i-1;j>=0;j--){
			sum *= q.pow(i-j-1);
			mint cur = 1;
			cur *= sum;
			cur *= dp[j];
			cur *= p;
			dp[i] += cur;
		}
	}
	*/
	
	mint ans = 0;
	mint sum = 1;
	for(int i=T;i>=0;i--){
		sum *= q.pow(T-i);
		mint cur = 1;
		cur *= dp[i];
		cur *= sum;
		ans += cur;
	}
	cout<<ans.val()<<endl;
	
	return 0;
}