/*
 * @Author: dsaDadas11
 * @Date: 2024-06-27 10:33:26
 * @LastEditTime: 2024-09-22 20:31:54
 * @Description: go for it!
 */
#include<bits/stdc++.h>
#define endl '\n'
#define ll long long
#define int ll
using namespace std;
constexpr int N=1e6+7;
constexpr int M=2e3+7;
constexpr int mod=998244353;
int quickpow(int x,int y)
{
	int ans=1;
	while(y)
	{
		if(y&1) ans=(ans*x)%mod;
		x=(x*x)%mod;
		y>>=1;
	}
	return ans;
}
int niyuan(int x)
{
	return quickpow(x,mod-2);
}
int x,y;
int a0,a1,b,a;
int p0,p1;
int dfs(int x,int y)
{
	if(x>y)
	{
		int cnt1=x/y;
		int r=x%y; //x
		int tp=(p0*(1-quickpow(p1,cnt1))%mod)*niyuan(1-p1)%mod;
		if(r==0)
		{
			return tp;
		}
		return tp*dfs(r,y);
	}
	if(x<y)
	{
		int cnt=y/x;
		int tp=quickpow(p0,cnt);
		y-=cnt*x;
		if(y==0) return tp;
		return tp*dfs(x,y);
	}
	if(x==y)
	{
		return p0;
	}
	return 0;
}
void solve()
{
	cin>>x>>y;
	cin>>a0>>a1>>b;
	a=a0+a1;
	p0=a0*niyuan(a)%mod;
	p1=a1*niyuan(a)%mod;
	if(x==y)
	{
		cout<<p0<<endl;
		return;
	}
	int tp=1;
	if(x<y)
	{
		int cnt=y/x;
		tp=quickpow(p0,cnt);
		y-=cnt*x;
		if(y==0)
		{
			cout<<tp<<endl;
			return;
		}
	}
	// 现在 x>y了
	int ans=tp*dfs(x,y)%mod;
	cout<<ans<<endl;
}
signed main()
{
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	int T=1; cin>>T;
	while(T--){solve();}
	return 0;
}