#include<bits/stdc++.h>
using namespace std;
#define int long long
const int pi=998244353;
int ksm(int a,int b){
    int res=1;
    while(b){
        if(b&1)res=res*a%pi;
        a=a*a%pi;b>>=1;
    }
    return res;
}
int sa,sb,pa,pb,bi;
int gcd(int a,int b){
    swap(pa,pb);
    // printf("[%d %d]\n",a,b);
    // if(a<b)return (pi+1-gcd(b,a))%pi;
    if(b==0)return 0;
    int p=a/b;
    p=ksm(pa,p);
    int c=a%b;
    // printf("(%d %d)\n",p,c);
    int p1=(1+pi-gcd(b-c,c))%pi;
    // printf("(%d %d %d)%d\n",pa,pb,p1,(pa+pb*p1%pi)%pi);
    return (p*(pa+pb*p1%pi)%pi)%pi;
}
void solve(){
    scanf("%lld%lld%lld%lld%lld",&sa,&sb,&pa,&pb,&bi);
    if(pa==0){printf("0\n");return ;}
    if(pb==0){printf("1\n");return ;}
    bi=pa+pb;bi=ksm(bi,pi-2);
    swap(sa,sb);
    swap(pa,pb);
    pa=pa*bi%pi;pb=pb*bi%pi;
   // printf("(%d %d)\n",pa,pb);
    printf("%lld\n",(gcd(sa,sb)%pi+pi)%pi);
}
signed main(){
    int t;scanf("%lld",&t);
    for(int i=1;i<=t;i++)
    solve();return 0;
}