#include<bits/stdc++.h>
#define int long long
#define pii pair<int,int>
#define endl '\n'
using namespace std;
const int N=1e6+10;
const int mod=998244353;
int qpow(int a,int n){
	int ans=1;
	while(n){
		if(n&1)ans=ans*a%mod;
		a=a*a%mod;
		n/=2;
	}
	return ans;
}
int a,b,c;
int cnt;
int pa,pb;
void dfs(int l,int r,int p){
	if(r>l){
		int cs=(r-1)/l;
		int rs=p*qpow(pa,cs)%mod;
//		cout<<cs<<" "<<cnt<<endl;
		dfs(l,r-cs*l,rs);
	}
	else if(r==l){
		cnt=(cnt+p*pa%mod)%mod;
//		cout<<"fin"<<" "<<cnt<<endl;
	}
	else{
		int cs=(l-1)/r;
		int fz=(qpow(a+b,cs)-qpow(b,cs)+mod)%mod*qpow(qpow(a+b,cs),mod-2)%mod;
		int fm=a%mod*qpow(a+b,mod-2)%mod;
		int rs=pa*p%mod*fz%mod*qpow(fm,mod-2)%mod;
		cnt+=rs;
		cnt%=mod;
		rs=p*qpow(pb,cs)%mod;
//		cout<<cs<<" "<<cnt<<endl;
		if(l-cs*r<r)return;
		dfs(l-cs*r,r,rs);
	}
}
void solve(){
	int x,y;
	cin>>x>>y;
	cin>>a>>b>>c;
	cnt=0;
	pa=a*qpow(a+b,mod-2)%mod;
	pb=b*qpow(a+b,mod-2)%mod;
	dfs(x,y,1);
//	cout<<pa*pa%mod*pa%mod<<endl;
	cout<<cnt<<endl;
}
signed main(){
	ios::sync_with_stdio(false);
	cin.tie(0);cout.tie(0);
	int T=1;
	cin>>T;
	while(T--){
		solve();
	}
	return 0;
}