#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 998244353;

ll qpow(ll a, ll n)
{
    ll res = 1;
    a %= MOD;
    while (n)
    {
        if (n & 1)
            res = res * a % MOD;
        a = a * a % MOD;
        n >>= 1;
    }
    return res;
}
int main()
{
    int T;
    cin >> T;
    while (T--)
    {
        ll x, y, a0, a1, b, kk = 1, bb = 0;
        cin >> x >> y >> a0 >> a1 >> b;
        kk = 1, bb = 0;
        ll k1 = (a0 + a1) * qpow(a1, MOD - 2) % MOD;
        ll k2 = (a0 + a1) * qpow(a0, MOD - 2) % MOD;
        while (x != y)
        {
            if (x > y)
            {
                ll n = x / y + x % y - 1;
                ll qp = qpow(k1, n);
                kk = qp * kk % MOD;
                bb = (1 - (1 - bb) * qp + MOD) % MOD;
                x = x - n * y;
            }
            else if (x < y)
            {

                ll n = y / x + y % x - 1;
                ll qp = qpow(k2, n);
                kk = qp * kk % MOD;
                bb = qp * bb % MOD;
                y = y - n * x;
            }
        }
        ll ans = (a0 * qpow(a0 + a1, MOD - 2) - bb + MOD) * qpow(kk, MOD - 2) % MOD;
        cout << ans << '\n';
    }
    return 0;
}