#include<bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0);cin.tie(0);cout.tie(0)
typedef long long ll;
const int N=1e6+10;
const ll mod=998244353;
ll qpow(ll a,ll b){
	ll sum=1;
	a%=mod;
	while(b){
		if(b&1) 
		sum=sum*a%mod;
		a=a*a%mod;
		b>>=1;
	}
	return sum%mod;
}
int main()
{
	IOS;
	int T;
	cin>>T;
	while(T--)
	{
		ll x,y;
		cin>>x>>y;
		ll a0,a1,b;
		cin>>a0>>a1>>b;
		ll p0,p1;
		p0=(a0*(qpow(a0+a1,mod-2)))%mod;
		p1=(a1*(qpow(a0+a1,mod-2)))%mod;
		if(x==y)
		{
			cout<<p0<<"\n";
		}
		else
		{
			ll temp=0;
			ll p=1;
			while(x!=y)
			{		
				if(x>y)
				{
					ll t=x/y;
					x-=(t*y);
					ll p3=(1-qpow(p1,t)+mod)%mod;
					p3=(p3*(qpow((1-p1+mod)%mod,mod-2)%mod))%mod;
					p3=(p3*p0)%mod;
					ll p4=qpow(p1,t)%mod;
					if(x==0)
					{
						p=(p*p3)%mod;
						cout<<(p+temp)%mod<<"\n";
						break;
					}
					p=(p*p4)%mod;
					temp=(temp+p3)%mod;
				}
				else if(x<y)
				{
					ll t=(y-1)/x;
					ll p3=qpow(p0,t);
					p=(p3*p)%mod;
					y-=(t*x);
					if(x==y)
					{
						cout<<(((p*p0)%mod)+temp)%mod<<"\n";
						break;
					}
				}
			}
		}
	}
	return 0;
}