#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int mod=998244353;
int x,y,a0,a1,b,p0,p1,ans;
int qpow(int a,int b){
	int res=1;
	while(b){
		if(b&1) res=1ll*res*a%mod;
		a=1ll*a*a%mod;
		b>>=1;
	}
	return res;
}
int inv(int x){
	return qpow(x,mod-2);
}
void work(){
	cin>>x>>y;
	cin>>a0>>a1>>b;
	b=inv(a0+a1);
	p0=1ll*a0*b%mod;
	p1=1ll*a1*b%mod;
	
	if(x<y) ans=qpow(p0,ceil((y-x)/x)+1);
	else if(x==y) ans=p0;
	else{
		ans=1ll*(1ll-qpow(p1,(x-y)/y+1)+mod)%mod*inv((1ll-p1+mod)%mod)%mod;
		ans=1ll*ans*p0%mod;
	}
	cout<<ans<<"\n";
}
int main(){
	int T;
	cin>>T;
	while(T--) work();
	return 0;
}