#include <bits/stdc++.h>
using namespace std;
const int N = 1e5+5;
const int mod = 998244353;
typedef long long ll;
ll n,x,y,a0,a1,b,cnt,cha1,cha2;
ll ans;
inline void read(ll& a)
{
    int s=0,w=1;
    char ch=getchar();
    while(ch<'0'||ch>'9')
    {
        if(ch=='-')w=-1;
        ch=getchar();
    }
    while(ch>='0'&&ch<='9')
    {
        s=s*10+ch-'0';
        ch=getchar();
    }
    a=s*w;
}
ll ksm(ll i,ll k)
{
     //cout<<"2"<<endl;
    ll res=1;
    while(k>0)
    {
        if(k&1)res=res*i%mod;
        i=i*i%mod;
        k>>=1;
    }
    return res;
}
ll dp(ll x,ll y)
{
    //cout<<"1"<<endl;
    ll v=0;
    if(x==0)return 0;
    if(y==0)return 1;
    if(x>y)
    {
        v+=(cha2*dp(x-y,y))%mod;
        v%=mod;
        v+=(cha1)%mod;
        v%=mod;
    }
    if(x<=y)
    {
        v=(cha1*dp(x,y-x))%mod;
    }
    return v%mod;
}
ll prime(ll x, ll y)
{
    ll v=0;
    if(a0==0||a1==0){
        if(a0==0) return 0;
        if(a1==0) return 1;
    }
    else{
    if(x/y>1)
    {
        //for(int i=1;i<=x/y;i++){v+=cha1*ksm(cha2,i-1)%mod;v%=mod;}
        v+=cha1*(1-ksm(cha2,x/y-1))*ksm(1-cha2,mod-2);
        v+=dp(x-(x/y)*y,y);
        //v+=(ksm(cha2,x/y)*dp(x-x/y*y,y))%mod;
        v%=mod;
    }
    if(y/x>=1)
    {
        v+=(ksm(cha1,y/x)*dp(x,y-y/x*x))%mod;
        v%=mod;
    }
    return v;
    }
}
int main()
{
    read(n);
    while(n--)
    {
        ans=0;
        read(x);read(y);
        read(a0);read(a1);read(b);
        cnt=a0+a1;
        cha1=a0*ksm(cnt,mod-2)%mod;
        cha2=a1*ksm(cnt,mod-2)%mod;
        printf("%lld\n",prime(x,y));

    }
}
/*
 3
 1 1
 2 2 6
 1 3
 2 3 6
 3 4
 7 3 15
 */