#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;
}
map<array<int, 2>, int>mmm;
int dfs(int chou1, int chou2, int p1, int p2)
{
	
	if (chou1 <= 0)
	{
		return 0;
	}
	else if (chou2 <= 0)
	{
		return 1;
	}
	else if (mmm.count({ chou1,chou2 }))
	{
		return mmm[{chou1, chou2}];
	}
	else {
		int temp= qp(p1 + p2, mod - 2, mod);
		int pa = p1 * temp%mod;
		int pb = p2 * temp % mod;
		int nm1 = __gcd(chou1, chou2 - chou1);
		int nm2 = __gcd(chou1 - chou2, chou2);
		mmm[{chou1, chou2}]=(pa* dfs(chou1/nm1, (chou2 - chou1)/nm1, p1, p2)%mod + pb * dfs((chou1 - chou2)/nm2, chou2/nm2, p1, p2)%mod)%mod;
		return mmm[{chou1, chou2}];
	}
}
void solve()
{
	mmm.clear();
	int a, b; cin >> a >> b;
	int temp = __gcd(a, b);
	a /= temp; b /= temp;
	int x, y, z; cin >> x >> y >> z;
	cout << dfs(a, b, x, y) << endl;
}
signed main()
{
	int T; cin >> T;
	while (T--)
	{
		solve();
	}
	/*int p1 = 2; int p2 = 8;
	cout << p1 << " " << p2 << endl;
	for (int i = 1; i <= 10; i++)for (int j = 1; j <= 10; j++)
	{
		cout << "A有筹码" << i << "   B有筹码" << j << "  " <<dfs(i,j,p1,p2)<<endl;
	}*/


}