#include <bits/stdc++.h>
#define int long long 
#define INF 0x3f3f3f3f
#define fr first
#define se second
#define endl '\n'
using namespace std;
typedef long long ll;
typedef pair<int,int> PII;

const int N = 2e5 + 10;
const int MOD = 998244353;

ll qpow(int a, int b, int p)
{
	ll res = 1;
	while (b)
	{
		if (b & 1) res = res * a % p;
		b >>= 1;
		a = 1ll * a * a % p;
	}
	return res;
}

int x,y;
int a0,a1,b;

void solve()
{
	cin>>x>>y;
	cin>>a0>>a1>>b;
	int p = a0 * qpow( a0 + a1 , MOD - 2 , MOD) % MOD;
	if(x == y)
	{
		cout << p << endl;
		return;
	}
	//辗转相减x,y
	ll ans = 0;
	ll now = 1;//进行到当前过程时的概率
	bool flag = (x<y);
	while(1)
	{
		if(x==y)
		{
			if(flag) ans = (ans + now * p) % MOD;
			break;
		}
		else if(x>y)
		{
			int num = (x - 1) / y;
			x = x - num * y;
			assert(x<=y);
			
			ans = ( ans + now * (1 - qpow( 1 - p + MOD , num + 1 , MOD) + MOD) % MOD ) % MOD;
			
			now = now * qpow( 1 - p + MOD , num , MOD ) % MOD;

			flag = false;
		}
		else if(x<y)
		{
			int num = (y - 1) / x;
			y = y - num * x;
			assert(y<=x);

			now = now * qpow( p , num , MOD ) % MOD;
			
			flag = true;
			//ans = (ans + now * p) % MOD;
		}
	}
	cout << ans << endl;
}


signed main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	int T=1; cin>>T;
	while(T--) solve();
	return 0;
}