#include<bits/stdc++.h>
using namespace std;
const int N=1e5+100;
const int Mod=998244353;
int qr(){
    int x=0,f=0;char ch=0;
    while(!isdigit(ch)){f|=ch=='-';ch=getchar();}
    while(isdigit(ch)){x=(x<<1)+(x<<3)+(ch^48);ch=getchar();}
    return f?-x:x;
}
long long qkpow(long long a,long long b){
    long long res=1;
    while(b){
        if(b&1) res=(res*a)%Mod;
        a=(a*a)%Mod,b>>=1;
    }
    return res%Mod;
}
int gcd(int a,int b){
    return b?gcd(b,a%b):a;
}
int main(){
    int T=qr();
    while(T--){
        int x=qr(),y=qr(),a0=qr(),a1=qr(),b=qr();
        int p;
        int ans;
        bool flag=0;
        if(x>y){
            flag=1;
            swap(x,y),swap(a0,a1);
        }
        int m=1ll*a0%Mod*qkpow(a0+a1,Mod-2)%Mod,n=1ll*a1*qkpow(a0+a1,Mod-2)%Mod;
        if(x==y){
            ans=m;
            printf("%d\n",ans);
            continue;
        }if(x<y&&y%x==0){
            p=y/x;
            ans=qkpow(m,p);
            printf("%d\n",ans);
            continue;
        }else{
            p=(y-1)/x;
            int z=(y-x)%x;
            ans=qkpow(m,p+1);
            int u=0,v=1;
            while(x!=gcd(x,z)){
                u++;
                if(x>2*z) x-=z,(ans+=1ll*qkpow(m,p+v)*qkpow(n,u)%Mod)%=Mod;
                else{
                    x-=z,v=p+(z-1)/x;
                    (ans+=1ll*qkpow(n,u)*qkpow(m,p+v)%Mod)%=Mod,z-=x;
                } 
            }
        }
        if(flag){
            ans=(1-ans+Mod)%Mod;
        }
        printf("%d\n",ans);
    }
    return 0;
}
/*
3
1 1
2 2 6
1 3
2 3 6
3 4
7 3 15

*/