//在决定放弃以前多写一点题吧~
//just solve more problems before giving up

//created: 2024-09-22 18:44:32
//#define SKADI
#if defined(YUANSHEN)
#include<D:/Tovi/template/my_template.hpp>
#else
#include<bits/stdc++.h>
using namespace std;
#endif
#ifndef SKADI
#define dbg(...) 42
#endif
template <typename T1, typename T2> void cmin(T1 &x, const T2 &y) {
x = x < y ? x : y;
}
template <typename T1, typename T2> void cmax(T1 &x, const T2 &y) {
x = x > y ? x : y;
}
using ll = long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
#define fixset(x) fixed<<setprecision(x)
#define fi first
#define se second
#define sz(x) (int)(x).size()
#define all(x) (x).begin(),(x).end()
#define ALL(x) (x).begin()+1,(x).end()
#define see "\n*********C-O-D-E-F-O-R-C-E-S**********\n"
const int INF = 1000000000;
const ll LNF = 1000000000000000000;
const int mod = 998244353;
ll ksm(ll a,ll b)
{
    ll res=1;
    while(b){
        if(b&1) res=res*a%mod;
        a=a*a%mod,b>>=1;
    }
    return res;
}
ll inv(ll x){return ksm(x,mod-2);}
ll p0,p1;
ll dfs(int x,int y,int a,int b)
{
    if(x<=0) return 0;
    if(x==y){
        return p0;
    }
    if(x<y){
        //看看赢几局
        int n=y/x;
        if(y%x==0) n--;
        return ksm(p0,n)*dfs(x,y-n*x,a,b)%mod;
    }else{
        int n=x/y;
        if(x%y==0) n--;
        return ((1-ksm(p1,n+1)+mod)%mod+ksm(p1,n+1)*dfs(x-(n+1)*y,y,a,b))%mod;
    }
}
void solve()
{
    int x,y,a0,a1,b;
    cin>>x>>y>>a0>>a1>>b;
    p0=a0*inv(a0+a1)%mod,p1=a1*inv(a0+a1)%mod;
    // cerr<<p0<<'\n';
    cout<<dfs(x,y,0,0)<<'\n';
}

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