#include <bits/stdc++.h>
#define int long long
#define pii pair<int, int>
#define fi first
#define se second
using namespace std;
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", print_args(__VA_ARGS__)
template <class... T>
void print_args(T... args) { ((cerr << args << ' '), ...) << '\n'; }
using u32 = unsigned;
using u64 = unsigned long long;
using i64 = long long;
using i128 = __int128_t;
const int mod = 998244353;
int power(int x, int y) {
    int res = 1;
    while (y) {
        if (y & 1) res = res * x % mod;
        x = x * x % mod;
        y >>= 1;
    }
    return res;
}
void solve() {
    int x, y, a0, a1, b;
    cin >> x >> y >> a0 >> a1 >> b;
    int p0 = a0 * power((a0 + a1) % mod, mod - 2) % mod;
    int p1 = a1 * power((a0 + a1) % mod, mod - 2) % mod;
    int ans = 0, tmp = 1;
    if (x == y) {
        cout << p0 % mod << '\n';
        return;
    }
    while (x != y) {
        if (x > y) {
            int ci = (x - 1) / y;
            x -= ci * y;
            int t = (x == y ? ci : ci - 1);
            int fm = power((1 - p1 + mod) % mod, mod - 2) % mod;
            int fz = (1 - power(p1, t + 1) + mod) % mod;
            ans = ans + tmp % mod * fz % mod * fm % mod;
            ans %= mod;
            t = (x == y ? ci : ci + 1);
            fz = (1 - power(p1, t + 1) + mod) % mod;
            tmp = tmp * fz % mod * fm % mod;
        } else {
            int ci = (y - 1) / x;
            y -= ci * x;
            tmp = tmp * power(p0, ci) % mod;
            if (x == y) ans = ans + tmp % mod;
        }
    }
    ans = ans * p0 % mod;
    cout << ans << '\n';
}
signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int _ = 1;
    cin >> _;
    while (_--) {
        solve();
    }
    return 0;
}