#include<bits/stdc++.h>
#define int long long
#define endl "\n"
using namespace std;
const int MOD = 998244353;
int power(int a, int  b, int p) {// a^ b % p
    int res = 1;
    for (; b; b /= 2, a =  a * a % p) {
        if (b % 2 == 1) {
            res =  res * a % p;
        }
    }
    return res;
}
void read() {
    int x, y;
    cin >> x >> y;
    int a0, a1, b;
    cin >> a0 >> a1 >> b;
    int ans = 0, res = a0 % MOD * power(a1 + a0, MOD - 2, MOD) % MOD; //res:单回合获胜的概率
    if(x == y) {
        ans = a0 % MOD * power(a1 + a0, MOD - 2, MOD) % MOD;
        cout << ans << endl;
    } else {
        int num1 = 0, num2 = 0, i = 0, temp = 1; //temp:到目前情况的概率
        if(x > y) ans = res;
        while(y != 0 && x != 0 && y != x) {
            if(y >= x) {//y>=x时，只许胜不许败
                num1 = y % x == 0 ? y / x - 1 : y / x;
                y %= x;
//                int q = (power(a0 + a1, num1, MOD) - a0 * power(a0 + a1, num1 - 1, MOD) + MOD) % MOD;//等比数列求和的分母
//                q = power(q, MOD - 2, MOD);//逆元
//                int u = (power(a0 + a1, num1, MOD) - power(a0, num1, MOD) + MOD) % MOD;//1-q的num1次方
//                ans += res * temp % MOD * a0 % MOD * power(a0 + a1, num1 - 1, MOD) % MOD  * u % MOD * q % MOD;
                temp = temp * power(a0, num1, MOD) % MOD * power(power(a0 + a1, num1, MOD), MOD - 2, MOD) % MOD;
                ans += res * temp % MOD;
            } else {//可败，败了影响概率,等比数列求和
                num2 = x % y == 0 ? x / y - 1 : x / y;
                x %= y;
                //cout<<temp<<" "<<num2<<endl;
                int q = (power(a0 + a1, num2 + 1, MOD) - a1 * power(a0 + a1, num2, MOD) % MOD + MOD) % MOD; //分母
                q = power(q, MOD - 2, MOD);//逆元
                int u = (power(a0 + a1, num2, MOD) % MOD - power(a1, num2, MOD) % MOD + MOD) % MOD;
                ans += res * temp % MOD * a1 % MOD * u % MOD * q % MOD;
                temp = temp * power(a1, num2, MOD) % MOD * power(power(a0 + a1, num2, MOD), MOD - 2, MOD) % MOD;
            }
            ans %= MOD;
        }
        cout << ans << endl;
//       cout<<(7*power(10,MOD-2,MOD)%MOD)<<endl;
    }
}
signed main() {
    ios::sync_with_stdio(false), cout.tie(0), cin.tie(0);
    int t = 1;
    cin >> t;
    while(t--) {
        read();
    }
    return 0;
}