#include<iostream>
#include<math.h>
#define mod 998244353
#define int long long
using namespace std;
int exgcd(int a,int b,int &x,int &y){
	if(b==0){
		x=1,y=0;
		return a;
	}
	int d=exgcd(b,a%b,y,x);
	y-=a/b*x;
	return d;
}
int qpow(int a,int b){
	int m=1;
	while(b>1){
		if(b%2==0){
			a=a*a%mod;
			b/=2;
		}
		else{
			m=m*a%mod;
			a=a*a%mod;
			b/=2;
		}
	}
	return a*m%mod;
}
signed main(){
	int t;
	cin>>t;
	while(t--){
		int x,y,a0,a1,b,u,v;
		int ans=0;
		cin>>x>>y>>a0>>a1>>b;
		exgcd(a0+a1,mod,u,v);
		int p=1;
		while(1){
			if(x>=y){
				x-=y;
				(p*=u)%=mod;
				(ans+=p*a0)%=mod;
				(p*=a1)%=mod;
				if(!x) break;	
			}
			else{
				y-=x;
				(p*=a0)%=mod;
				(p*=u)%=mod;
			}
		}
		//cout<<ans<<' '<<q<<endl;
		cout<<(ans+mod)%mod<<endl;
	}
	return 0;
}