#include<bits/stdc++.h>
#define int long long
using namespace std;
const int mod = 998244353;
int qp(int a, int b, int mod)
{
	int ans = 1;
	while (b)
	{
		if (b & 1)
		{
			ans = ans * a % mod;
		}
		b >>= 1;
		a = a * a % mod;
	}
	return ans;
}
int temp;
int dfs(int x, int y, int p1, int p2)
{
	if (y == 0)
	{
		return 1;
	}else
	if (x == y)
	{
		return p1 * temp % mod;
	}
	else if(x>y){
		return (p1*temp%mod+p2 * temp % mod *dfs(x - y, y, p1, p2)%mod)%mod;
	}
	else if (x < y)//少
	{
		int t = y / x;
		if (y % x == 0)
		{
			t--;
		}
		return qp(p1 * temp % mod, t, mod) * dfs(x, y - t * x, p1, p2) % mod;
	}
}
void solve()
{
	int x, y; cin >> x >> y;
	int a, b, c; cin >> a >> b >> c;
	temp = qp(a + b, mod - 2, mod);
	cout << dfs(x, y, a, b) << endl;
}
signed main()
{
	int T; cin >> T;
	while (T--)
	{
		solve();
	}

}