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

typedef long long ll;
const int mod = 998244353; 

ll pa, pb, pnotdraw;

ll ksm(ll a, ll b){
	a %= mod;
	b %= mod;
	ll res = 1;
	while(b){
		if(b & 1) res = (res * a) % mod;
		a = (a * a) % mod;
		b >>= 1;
	} 
	return res;
}

ll f(ll x, ll y){//返回awin的概率 
	if(x <= y){
		ll kb = y / x;
		if(y % x == 0) return ksm(pa, kb);
		return ksm(pa, kb) * f(x, y % x) % mod;
	}
	else{
		ll kb = x / y;
		if(x % y == 0) return (1 - ksm(pb, kb) + mod) % mod;
		return ((1 - ksm(pb, kb) * ((1 - f(x % y, y) + mod) % mod) % mod + mod) % mod);
	}
}

void solve(){
	ll x, y;
	ll a, b, c;
	cin >> x >> y >> a >> b >> c;
	pnotdraw = (a + b) % mod * ksm(c, mod - 2) % mod; 
	a = a * ksm(c, mod - 2) % mod;
	b = b * ksm(c, mod - 2) % mod;
	pa = a * ksm(a + b, mod - 2) % mod;
	pb = b * ksm(a + b, mod - 2) % mod; 
	//pnotdraw = (a + b) % mod * ksm(c, )
	ll pdraw = ((1 - a - b) % mod + mod) % mod;
	//pnotdraw = ((1 - pdraw) % mod + mod) % mod;
	cout << f(x, y) << endl;
} 

void get(ll a, ll b){
	a %= mod;
	b %= mod;
	cout << a * ksm(b, mod - 2) % mod << endl;
}

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