#include<bits/stdc++.h>
using namespace std;
typedef long long ll;

const ll MOD=998244353;

ll pow(ll x,ll b){
	ll ans=1;
	x%=MOD;
	while(b){
		if(b&1) ans=ans*x%MOD;
		x=x*x%MOD;
		b>>=1;
	}
	return ans%MOD;
}

ll Inv(ll x){
	return pow(x,MOD-2)%MOD;
}

void solve(){
	ll x,y;
	cin>>x>>y;
	ll pa,pb,pz,sa,sb;
	cin>>pa>>pb>>pz;
	ll sum=pa+pb;
	ll gca=__gcd(pa,sum),gcb=__gcd(pb,sum);
	pa/=gca,sa=sum/gca,pb/=gcb,sb=sum/gcb;
	ll ka=pa*Inv(sa)%MOD,kb=pb*Inv(sb)%MOD;
//	cout<<"ka="<<ka<<" kb="<<kb<<endl;
	function<ll(ll,ll)> cal=[&](ll a,ll b){
		if(a==0) return 0ll;
		if(b==0) return 1ll;
		if(a>=b){
			ll pk=a/b;
//			cout<<"a="<<a<<" b="<<b<<" pk="<<pk<<endl;
			return ka*(pow(kb,pk)-1)%MOD*Inv(kb-1)%MOD+pow(kb,pk)*cal(a-pk*b,b)%MOD;
		}else if(a<b){
			ll pk=b/a;
//			cout<<"a="<<a<<" b="<<b<<" pk="<<pk<<endl;
			return pow(ka,pk)*cal(a,b-pk*a)%MOD;
		}
	};
	cout<<cal(x,y)<<endl;
}


int main(){
	int tt;
	cin>>tt;
	while(tt--){
		solve();
	}
	return 0;
	
}