#include<bits/stdc++.h>
using namespace std;
const int N = 3e5 + 10;
const int mod = 998244353;
typedef long long ll;
typedef pair<ll, ll> PII;
map<PII, ll> dp;

ll ksm(ll a, ll k)
{
    a %= mod;
    ll res = 1;
    while (k)
    {
        if (k & 1) res = res * a % mod;
        k >>= 1;
        a = a * a % mod;
    }
    return res;
}

ll calc(ll x, ll y, ll p0, ll p1)
{
    if (x <= 0) return 0;
    if (y <= 0) return 1;
    if (dp.count({x, y})) return dp[{x, y}];
    ll p = p0 * calc(x, y - x, p0, p1) % mod;
    p += p1 * calc(x - y, y, p0, p1) % mod;
    p %= mod;
    dp[{x, y}] = p, dp[{y, x}] = (1 - p + mod) % mod;
    return p;
}

void solve()
{
    dp.clear();
    ll x, y;
    ll p1, p2, p;
    cin >> x >> y >> p1 >> p2 >> p;
    ll a = p1 * ksm(p1 + p2, mod - 2);
    ll b = p2 * ksm(p1 + p2, mod - 2);
    ll ans = calc(x, y, a, b);
    cout << ans << "\n";
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr), cout.tie(nullptr);
    int T = 1;
    cin >> T;
    while (T -- ) solve();
    return 0;
}