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

const int p = 998244353;
int ans, p0, p1, t;
int qmi(int a, int b)
{
    int res = 1;
    for (; b; b >>= 1)
    {
        if (b & 1)
            res = res * a % p;
        a = a * a % p;
    }
    return res;
}

int gcd(int a, int b)
{
    return b ? gcd(b, a % b) : a;
}

void calc(int x, int y)
{
    if (x == 1)
    {
        ans = (ans + t * qmi(p0, y) % p) % p;
        return;
    }
    else if (y == 1)
    {
        ans = (ans + t * (1 - qmi(p1, x) + p) % p) % p;
        return;
    }
    if (x > y)
    {
        int n = x / y;
        ans = (ans + t * (1 - qmi(p1, n)) % p) % p;
        t = t * qmi(p1, n) % p;
        x = x % y;
    }
    else
    {
        int n = y / x;
        t = t * qmi(p0, n) % p;
        y = y % x;
    }
    calc(x,y);
}

void solve()
{
    ans = 0, t = 1;
    int x, y;
    int a0, a1, b;
    cin >> x >> y;
    cin >> a0 >> a1 >> b;
    p0 = a0 * qmi(a0 + a1, p - 2) % p;
    p1 = a1 * qmi(a0 + a1, p - 2) % p;
    int g = gcd(x, y);
    x /= g, y /= g;
    calc(x, y);
    cout << ans << '\n';
}

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