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

//created: 2024-09-21 19:11:29
// #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 a0,a1,B,ans;
ll ksm(ll x,ll y)
{
    ll res=1;
    while(y){
        if(y&1) res=res*x%mod;
        x=x*x%mod;
        y>>=1;
    }
    return res;
}
ll inv(ll x)
{
    return ksm(x,mod-2);
}

ll calc(ll x,ll y)
{
    ll res=1;
    for(int i=1;i<=x;i++)
        res*=a0*B%mod,res%=mod;
    for(int i=1;i<=y;i++)
        res*=a1*B%mod,res%=mod;
    return res;
}
void dfs(ll x,ll y,ll a,ll b)
{
    cerr<<x<<" "<<y<<" "<<a<<" "<<b<<'\n';
    if(x==y){
        // ans+=a0*B%mod;
        ans+=calc(a+1,b);
        ans%=mod;
        // cerr<<a0<<" "<<B<<'\n';
        // cerr<<a0*b<<'\n';
        return;
    }
    if(x<y){
        dfs(x,y-x,a+1,b);
    }
    if(x>y){
        ans+=calc(a+1,b);
        dfs(x-y,y,a,b+1);
    }
}
void solve()
{
    ll x,y;
    cin>>x>>y>>a0>>a1>>B;
    int g=__gcd(a0,a1);
    a0/=g,a1/=g;
    B=inv(a0+a1);
    // if(a0==a1){
    //     cout<<b<<'\n';
    //     return;
    // }
    ans=0;
    dfs(x,y,0,0);
    cout<<ans<<'\n';
    // cout<<calc(1,0)<<'\n';
    // vis.clear();
}

int main()
{
#ifndef SKADI
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
#endif
    // dbg(calc(2,0));
    // a0=1,a1=1,b=inv(2);
    // ll x=calc(1,0);

    // dbg(x);
    int T=1;
    cin>>T;
    while(T--)
        solve();
    return 0;
}
/*
10 2
8 4
*/