import java.util.Scanner;

public class Main {
	public static void main(String[] args) throws Exception {
		Scanner sc = new Scanner(System.in);
		int p1 = sc.nextInt();
		int p2 = sc.nextInt();
		int q1 = sc.nextInt();
		int q2 = sc.nextInt();
		int t = sc.nextInt();
		sc.close();

//		double p12 = (double) p1 / p2;
//		double q12 = (double) q1 / q2;
//		double[] b = new double[t + 1];
//		b[0] = 1;
//		double[][] r = new double[t + 1][t + 1];
//		r[0][0] = 1;
//		for (int i = 1; i <= t; i++) {
//			for (int j = 0; j < i; j++) {
//				b[i] += r[i - 1][j] * p12;
//			}
//			for (int j = 0; j < i; j++) {
//				r[i][j] = r[i - 1][j] * Math.pow(q12, i - j);
//			}
//			r[i][i] = b[i];
//		}
//
//		double ans = 0;
//		for (int j = 0; j < r.length; j++) {
//			ans += r[t][j];
//		}
//		System.out.println(ans);

		int mod = 998244353;
		long p12 = p1 * modinv(p2, mod) % mod;
		long q12 = q1 * modinv(q2, mod) % mod;

		long[] b = new long[t + 1];
		b[0] = 1;
		long[][] r = new long[t + 1][t + 1];
		r[0][0] = 1;
		for (int i = 1; i <= t; i++) {
			for (int j = 0; j < i; j++) {
				b[i] += r[i - 1][j] * p12 % mod;
			}
			b[i] %= mod;
			for (int j = 0; j < i; j++) {
				r[i][j] = r[i - 1][j] * power(q12, i - j, mod) % mod;
			}
			r[i][i] = b[i];
		}

		long ans = 0;
		for (int j = 0; j < r.length; j++) {
			ans += r[t][j];
		}
		ans %= mod;
		System.out.println(ans);
	}

	static long modinv(long a, int m) {
		long b = m;
		long u = 1;
		long v = 0;
		long tmp = 0;

		while (b > 0) {
			long t = a / b;
			a -= t * b;
			tmp = a;
			a = b;
			b = tmp;

			u -= t * v;
			tmp = u;
			u = v;
			v = tmp;
		}

		u %= m;
		if (u < 0) u += m;
		return u;
	}

	static long power(long x, long n, int m) {
		if (n == 0) {
			return 1;
		}
		long val = power(x, n / 2, m);
		val = val * val % m;
		if (n % 2 == 1) {
			x %= m;
			val = val * x % m;
		}
		return val;
	}
}