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

#define int long long

const int mod = 998244353;

int x, y, a0, a1, b, p0, p1, ans;

int qmi(int a, int b)
{
    int res = 1;
    a %= mod;
    while (b) {
        if (b & 1)
            res = res * a % mod;
        b >>= 1;
        a = a * a % mod;
    }
    return res;
}

int inv(int x)
{
    return qmi(x % mod, mod - 2);
}

void dfs(int cur, int x, int y)
{
    // cout << x << ' ' << y << '\n';
    if (!x)
        return;
    if (!y) {
        ans += cur;
        return;
    }
    if (x < y) {
        dfs(cur * qmi(p0, y / x) % mod, x, y % x);
    } else {
        int k = x / y;
        int mul = (1 - qmi(p1, k) + mod) % mod * inv(1 - p1 + mod) % mod * p0 % mod;
        // cout << mul << '\n';
        ans = (ans + cur * mul % mod) % mod;
        dfs(cur * qmi(p1, k) % mod, x % y, y);
    }
}

void solve()
{
    cin >> x >> y >> a0 >> a1 >> b;
    p0 = a0 * inv(a0 + a1) % mod;
    p1 = a1 * inv(a0 + a1) % mod;
    // cout << p0 << ' ' << p1 << '\n';
    ans = 0;
    dfs(1, x, y);
    cout << ans << '\n';
}

signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);

    int T = 1;
    cin >> T;
    while (T--) {
        solve();
    }
    // cout << inv(2) << '\n';
}