#include <bits/stdc++.h>
#define int long long
#define ll __int128
#define endl '\n'
// #define x first 
// #define y second 
using namespace std;
const int N=1e6+10;
const int MOD=998244353;
const int INF=1e9; 
int n,m,q,k;
int quick_pow(int num,int d)
{
    int res=1;
    while(d)
    {
        if(d&1) res=res*num%MOD;
        num=num*num%MOD;
        d>>=1;
    }
    return res;
}
int inv(int num)
{
    return quick_pow(num,MOD-2);
}

void solve()
{
    int x,y;
    int a0,a1,t;
    cin>>x>>y>>a0>>a1>>t;
    int p=a0*inv(a0+a1)%MOD;
    int q=a1*inv(a0+a1)%MOD;
    int res=0,cur=1;
    while(x!=y)
    {
        if(x>y)
        {
            int times=(x-1)/y;
            res=(res+cur*(1-quick_pow(q,times)+MOD)%MOD)%MOD;
            cur=cur*quick_pow(q,times)%MOD;
            x-=times*y;
        }
        else
        {
            int times=(y-1)/x;
            cur=cur*quick_pow(p,times)%MOD;
            y-=times*x;
        }
    }
    res=(res+cur*p%MOD)%MOD;
    cout<<res<<endl;
}
signed main()
{
    // init();
    ios_base::sync_with_stdio(0); 
    cin.tie(0);cout.tie(0);
    int t=1;
    cin>>t;
    while(t--)
    solve();
    return 0;
}