#include <algorithm>
#include <cstdio>
#include <vector>
template <class T> using Arr = std::vector<T>;
typedef long long LL;
#define int LL
const int MOD = 998244353;
#define MUL(u, v) (int)((LL)(u) * (v) % MOD)
int Pow(int a, int b) { int r = 1; for (; b > 0; b >>= 1, a = MUL(a, a)) if (b & 1) r = MUL(r, a); return r; }

inline int inv(int x) { return Pow(x, MOD - 2); }

int gcd(int a, int b, int p0, int p1, int B, int B0) {
	if (b == 0) return 1;
	if (a == b)
		return MUL(p0, inv(p0 + p1));
	if (a < b)
		return (MOD + 1 - gcd(b, a, p1, p0, B0, B)) % MOD;
	int K = a / b, r = a % b;
	int C = 1;
	return (MUL(Pow(B, K), ((MOD + 1ll - gcd(b, r, p1, p0, B0, B)) % MOD - C) % MOD) + C) % MOD;
}

signed main() {
	int T;
	scanf("%lld", &T);
	while (T--) {
		int x, y;
		scanf("%lld%lld", &x, &y);
		int a0, a1, b;
		scanf("%lld%lld%lld", &a0, &a1, &b);
		// b = 1;
		a0 = MUL(a0, inv(b));
		a1 = MUL(a1, inv(b));
		int B = MUL(a1, inv(a0 + a1));
		int B0 = MUL(a0, inv(a0 + a1));
		int ans = gcd(x, y, a0, a1, B, B0) % MOD;
		printf("%lld\n", ans < 0 ? ans + MOD : ans);
	}
	return 0;
}