#include <bits/stdc++.h>
using namespace std;
#define int ll
#define ll long long
#define buff ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define endl '\n'
const int mod = 998244353;
const int P = 998244353;
const int N = 2e5 + 7;
const int M = 1e3 + 7;
int p0, p1, b;
int fz,fm;
int gcd(int a,int b) {
    return b>0 ? gcd(b,a%b):a;
}
int quickpow(int x, int y)
{
    int ans = 1;
    while (y)
    {
        if (y & 1)
        {
            ans = (ans * x) % mod;
        }
        y >>= 1;
        x = (x * x) % mod;
    }
    return ans;
}
int niyuan(int x)
{
    return quickpow(x, mod - 2);
}
pair<int,int> p;
pair<int,int> dfs(int x,int y)
{
	//cout<<x<<" "<<y<<'\n';
	if(x==y)
	{
		return {b-p1,b};
	}
	else if(x<y) 
	{
		pair<int,int> e;
		int n=y/x;
		if(y%x==0) e={1,1};
		else e=dfs(x,y-x*n);
		return {(quickpow(b-p1,n)*e.first)%mod,(quickpow(b,n)*e.second)%mod};
	}
	else if(x>y)
	{
		pair<int,int> e;
		int n=x/y;
		if(x%y==0) e={b-p1,b};
		else e=dfs(x-n*y,y);
		n--;
		return {((e.second*(abs(quickpow(b,n)-quickpow(p1,n))))%mod+(quickpow(p1,n)*e.first)%mod)%mod,(quickpow(b,n)*e.second)%mod};
	}
}
void solve()
{
	int x,y;
    cin >> x >> y >> p0 >> p1 >> b;
    b = p0 + p1;
    pair<int,int> pp=dfs(x,y);
    fz=pp.first;
    fm=pp.second;
    cout << fz * niyuan(fm) % mod << endl;
}

signed main()
{
    buff;
    int tt = 1;
    cin >> tt;
    while (tt--)
    {
        solve();
    }
    return 0;
}