#include<bits/stdc++.h>
#define int long long
#define eb emplace_back
#define rep(i, s, t) for (int i = (s);i <= (t);i++)
#define dep(i, t, s) for (int i = (t);i >= (s);i--)
#define For(i, n) for (int i = 0;i < (n);i++)
using namespace std;
using LL = long long;
using Pii = pair<int, int>;
const int N = 1e5 + 10, inf = 0x3f3f3f3f, P = 998244353;
const LL infLL = 0x3f3f3f3f3f3f3f3fLL;
int x, y, a, b, c, p;
struct Mat {
    int a[3][3];
    Mat() { memset(a, 0, sizeof a); }
    void build() {
        rep(i, 0, 2) a[i][i] = 1;
    }
    int* operator[](int i) {
        return a[i];
    }
};
Mat operator * (Mat A, Mat B) {
    Mat res;
    rep(i, 1, 2) {
        rep(j, 1, 2) {
            rep(k, 1, 2) (res[i][j] += A[i][k] * B[k][j]) %= P;
        }
    }
    return res;
}
Mat qpow(Mat A, int b) {
    Mat res; res.build();
    while (b) {
        if (b & 1) res = res * A;
        A = A * A; b >>= 1;
    }
    return res;
}
int qpow(int a, int b) {
    int res = 1;
    while (b) {
        if (b & 1) res = res * a % P;
        a = a * a % P; b >>= 1;
    }
    return res;
}
int f(int x, int y) {
    if (x == y) return p;
    if (x < y) {
        int k = (y - 1) / x; // 上取整
        return qpow(p, k) * f(x, y - k * x) % P;
    }
    if (x > y) {
        int k = (x - y) / y;
        if (k == 0) {
            return p + f(x - y, y);
        } else {
            Mat res;
            res[1][1] = 1 - p; res[1][2] = p;
            res[2][1] = 0; res[2][2] = 1;
            res = qpow(res, k);
            return (res[1][1] * f(x - k * y, y) % P + res[1][2] % P) % P;
        }
    }
}
void solve() {
    cin >> x >> y >> a >> b >> c;
    p = a * qpow(a + b, P - 2);
    int ans = f(x, y);
    ans = (ans % P + P) % P;
    cout << ans << '\n';
}
signed main() {
#ifdef LOCAL
    freopen("in.txt", "r", stdin);
#endif
    cin.tie(0)->ios::sync_with_stdio(false);
    int T = 1;
    cin >> T;
    while (T--) solve();
    return 0;
}