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

//* ATCODER
#include<atcoder/all>
using namespace atcoder;
typedef modint998244353 mint;
//*/

/* BOOST MULTIPRECISION
#include<boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
//*/

typedef long long ll;

#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)

template <typename T> bool chmin(T &a, const T &b) {
	if (a <= b) return false;
	a = b;
	return true;
}

template <typename T> bool chmax(T &a, const T &b) {
	if (a >= b) return false;
	a = b;
	return true;
}

template <typename T> T max(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]);
	return ret;
}

template <typename T> T min(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]);
	return ret;
}

template <typename T> T sum(vector<T> &a){
	T ret = 0;
	for (int i=0; i<(int)a.size(); i++) ret += a[i];
	return ret;
}

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	
	int p1, p2, q1, q2, t;
	cin >> p1 >> p2 >> q1 >> q2 >> t;

	mint p = mint(p1) / mint(p2);
	mint q = mint(q1) / mint(q2);

	vector<mint> hyo(t + 1);
	hyo[0] = 1;
	rep(i,1,t+1){
		hyo[i] = hyo[i-1] * q;
	}

	vector dp(t+1, vector<mint>(t+1));
	dp[0][0] = 1;
	rep(i,1,t+1){
		mint g = 0;
		rep(j,0,i){
			g += dp[i-1][j];
		}
		dp[i][i] = g * p;
		rep(j,0,i){
			dp[i][j] = dp[i-1][j] * hyo[i-j];
		}
	}

	cout << sum(dp[t]).val() << '\n';
}