#include <iostream>
#include <cstdio>
#define int long long
const int mod = 998244353;
using namespace std;

#define gc() getchar()
inline int read() {
    char c = gc(); int s = 0;
    for (; !isdigit(c); c = gc());
    for (; isdigit(c); c = gc()) s = s * 10 + c - 48;
    return s;
}

inline int mul(int a, int b) { return 1ll*a*b%mod; }
inline int add(int a, int b) { return a + b >= mod ? a + b - mod : a + b; }
inline int dec(int a, int b) { return a-b<0?a-b+mod:a-b; }
int Power(int a, int b) {
    int ans = 1;
    for (; b; b >>= 1) (b & 1 ? ans = mul(ans, a) : 0), a = mul(a, a);
    return ans;
}
int a1, a2, b, P, Q;
int X, Y;
int fun(int x, int y) {
 //   printf("x, y = %lld,%lld\n", x, y);
    if (x == y) return P;
    if (y % x == 0) return Power(P, y / x);
    if (x < y) return mul(Power(P, (y - 1) / x), fun(x, y - (y - 1) / x * x));
    int a = x / y, sum = 0;
    sum = dec(1, Power(Q, a));
    if (x % y == 0) return sum;
    return mul(sum, mul(Power(Q, a), fun(x - x / y * y, y)));
}
void Work() {
    X = read(), Y = read();
    a1 = read(), a2 = read(), b = read();
    P = mul(a1, Power(add(a1,a2), mod - 2));
    Q = mul(a2, Power(add(a1,a2), mod - 2));
    printf("%lld\n", fun(X, Y));
}
signed main() {
    int T; cin >> T;
    while (T --) Work();
    return 0;
}
/*
3
1 1
2 2 6
1 3
2 3 6
3 4
7 3 15

*/