#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll mod=998244353ll;
int _;
int x,y,a,b,d,sub,sinv;
ll ksm(ll a,ll b){
	ll res=1;
	while(b){
		if(b&1)res=res*a%mod;
		a=a*a%mod;
		b>>=1;
	}
	return res;
}
ll norm(ll x){
	return ((x%mod)+mod)%mod;
}
ll solve(int x,int y){
	if(x==y)return a*sinv%mod;//turansiwang
	if(x<y){//bunengshu
		int times=y/x;
		if(y==x*times)times-=1;
		int newy=y-x*times;
		ll bushu=ksm(a*sinv%mod,times);
		return solve(x,newy)*bushu%mod;
	}
	if(x>y){//zhiyao yingyiba
		int times=x/y;
		if(x==y*times)times-=1;
		int newx=x-y*times;
		ll ying=norm(1-ksm(b*sinv%mod,times));
		return norm(ying+norm(1-ying)*solve(newx,y)%mod);
	}
}
int main(){
	cin>>_;
	while(_--){
		cin>>x>>y;
		cin>>a>>b>>sub;
		sub=a+b;
		sinv=ksm(sub,mod-2);
		cout<<solve(x,y)<<endl;
	}
	return 0;
}