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

typedef long long ll;
const ll mod = 998244353; 

ll pa, pb;

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;
//		// y min calc py, 
//		ll py = ksm(pb, kb) * ((1 - f(x % y, y)) % mod + mod) % mod;
//		ll px = ((1 - py) % mod + mod) % mod;
//		return px; 
//		return ((1 - ksm(pb, kb) * ((1 - f(x % y, y) + mod) % mod) % mod + mod) % mod);
//	}
//}

ll f(ll x, ll y){
	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 ((1ll - ksm(pb, kb)) % mod + mod) % mod;
		}
		ll py = ksm(pb, kb) * (((1ll - f(x % y, y)) % mod + mod) % mod) % mod;
		ll px = ((1ll - py) % mod + mod) % mod;
		return px % mod;
	}
}

void solve(){
	ll x, y;
	ll a, b, c;
	cin >> x >> y >> a >> b >> c;
	pa = a * ksm(a + b, mod - 2) % mod;
	pb = b * ksm(a + b, mod - 2) % 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;
} 

/*
1000000 1
1 1 1
444030275
*/