#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 2e5 + 5;
const ll mod = 998244353;
ll qpow(ll x, ll y)
{
	ll res = 1;
	while (y)
	{
		if (y & 1) res = (res * (x % mod)) % mod;
		x = (x * x) % mod;
		y >>= 1;
	}
	return res;
}
ll inv(ll x)
{
	return qpow(x, mod - 2);
}
void solve()
{
	ll x, y, a, b, c;
	cin >> x >> y >> a >> b >> c;
	ll p1 = a * inv(a + b) % mod, p2 = b * inv(a + b) % mod;
	ll pre = 1, res = 0;
	while (x && y)
	{
		if (x >= y)//A可赢可输
		{
			ll t = x / y; x %= y;//可以输t次
			ll temp = qpow(p2, t);
			res = (res + pre * (1 - temp + mod) % mod) % mod;
			pre = pre * temp % mod;
		}
		else//B可赢可输
		{
			ll t = y / x; y %= x;
			ll temp = qpow(p1, t);
			if (y % x == 0) res = (res + pre * temp % mod) % mod;
			pre = pre * temp % mod;
		}
	}
	cout << res << '\n';
}
int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);
	int T; cin >> T;
	while (T--) solve();
	return 0;
}