#include <bits/stdc++.h>

#define fastio ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)

typedef double ff;
typedef long long int ll;
typedef unsigned long long int ull;
using namespace std;

typedef pair<ll, ll> pii;

const int N = 2e5 + 10, M = 1e7, mod = 998244353;

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

ll calc(ll x, ll y, ll p0, ll p1)
{
	// cout << x << ' ' << y << '\n';
	if(x == y) {
		return p0;
	}
	
	if(x < y) {
		int k = y / x;
		ll tmp = 0;
		if(y % x == 0) {
			return qpow(p0, k);
		}else return qpow(p0, k) * calc(x, y % x, p0, p1) % mod;
	} else { // x > y
		int k = x / y;
		ll now = ((1 - qpow(p1, k)) % mod + mod) % mod;
		
		if(x % y == 0) {	
			return now;
		} else {
			ll tmp = qpow(p1, k) * calc(x % y, y, p0, p1) % mod;
			return now + tmp % mod;
		}
	}
}

void solve()
{
	ll x, y, a0, a1, b;
	cin >> x >> y >> a0 >> a1 >> b;
	
	ll sc = a0 + a1;
	ll p0 = a0 * qpow(sc, mod - 2) % mod, p1 = a1 * qpow(sc, mod - 2) % mod;
	
	// cout << sc << ' ' << a0 << ' ' << a1 << '\n';
	// cout << qpow(2, mod - 2) << '\n'
	// cout << p0 << ' ' << p1 << '\n';
	cout << calc(x, y, p0, p1) << '\n';
}

int main()
{
	fastio;
	
	int t = 1;
	cin >> t;

	while( t -- ) solve();
}