#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define endl "\n"
#define pq priority_queue<int>
#define rep(i,a,n) for(int i=a;i<n;i++)
#define debug1(x) cout<<x<<endl;
#define debug2(a,b) cout<<a<<" "<<b<<endl;
const int INF = 0x3f3f3f3f;//无穷大
const int inf = 0xc0c0c0c0;//无穷小
const int mod = 998244353.;
const int N = 1;

/*
 ________  ___  ___  ___  _______   ________ ________   ___  ________   ________
|\   ____\|\  \|\  \|\  \|\  ___ \ |\  _____\\   ___  \|\  \|\   ___  \|\   ____\
\ \  \___|\ \  \\\  \ \  \ \   __/|\ \  \__/\ \  \\ \  \ \  \ \  \\ \  \ \  \___|
 \ \  \    \ \   __  \ \  \ \  \_|/_\ \   __\\ \  \\ \  \ \  \ \  \\ \  \ \  \  ___
  \ \  \____\ \  \ \  \ \  \ \  \_|\ \ \  \_| \ \  \\ \  \ \  \ \  \\ \  \ \  \|\  \
   \ \_______\ \__\ \__\ \__\ \_______\ \__\   \ \__\\ \__\ \__\ \__\\ \__\ \_______\
    \|_______|\|__|\|__|\|__|\|_______|\|__|    \|__| \|__|\|__|\|__| \|__|\|_______|
                                                                                     */
ll fpm(ll a,ll b) {
    a%=mod;
    ll ans = 1;
    while (b) {
        if (b & 1)
            ans = (ans * a) % mod;
        b >>= 1;
        a = (a * a) % mod;
    }
    return ans;
}
ll inv(int x){
    return fpm(x,mod-2);
}

void ChiefNing()
{
    int x,y;
    cin>>x>>y;
    int a,b,c;
    cin>>a>>b>>c;
    int pa=a*inv(a+b)%mod,pb=b*inv(a+b)%mod;
    if(x==y){
        cout<<pa<<endl;
        return ;
    }
    int ans=0,now=1;
    bool is=0;//表示是否第一次达到
    while(x!=y){
        if(x<y){
            if(is){
                int cs=y/x;
                y-=(cs*x);
                if(y==0){
                    cs--;
                    y=x;
                }
                for(int i=1;i<=cs;i++){
                    now*=pa;
                    now%=mod;
                    ans+=((now*pa)%mod);
                    ans%=mod;
                }
            }
            else{
                int cs=y/x;
                y-=(cs*x);
                if(y==0){
                    cs--;
                    y=x;
                }
                now*= (fpm(pa,cs)%mod);
                now%=mod;
            }
        }
        else{
            if(!is){
                ans+=((now*pa)%mod);
                ans%=mod;
            }//此时是第一次满足，那么需要乘一下当前值
            is=1;
            int cs=x/y;
            x-=(cs*y);
            if(x==0){
                cs--;
                x=y;
            }
            for(int i=1;i<=cs;i++){
                now*=pb;
                now%=mod;
                ans+=((now*pa)%mod);
                ans%=mod;
            }
        }
    }
    if(!is)ans+=((now*pa)%mod);
    cout<<ans%mod<<endl;
}


signed main(void)
{
    ios::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    int _;
    cin>>_;
    while(_--)
        ChiefNing();
    return 0;
}