#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using mint = modint998244353;
const int mod = 998244353;
//using mint = modint1000000007;
//const int mod = 1000000007;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int p1, p2, q1, q2, t;
	cin >> p1 >> p2 >> q1 >> q2 >> t;
	mint p = (mint)p1 / p2;
	mint q = (mint)q1 / q2;
	vector dp(t + 1, vector<mint>(t + 1));
	dp[0][0] = 1;
	rep(i, t) {
		rep(j, t + 1) {
			if (0 == dp[i][j])continue;
			mint q2 = pow_mod(q.val(), j + 1, mod);
			int ni = i + 1;
			dp[i + 1][0] += dp[i][j] * p;
			dp[i + 1][j + 1] += dp[i][j] * q2;
		}
	}
	mint ans = 0;
	rep(i, t + 1)ans += dp[t][i];
	cout << ans.val() << endl;
	return 0;
}