#include<bits/stdc++.h>
#define int long long
using namespace std;
int x,y,a,b,c;
const int mod=998244353;
int ksm(int base,int sum)
{
   int ans=1;
   while(sum)
   {
       if(sum%2)
        ans*=base;
       base*=base;
       sum/=2;
       ans%=mod;
       base%=mod;
   }
   return ans;
}
int nt(int o1,int p1)
{
   return ((ksm(p1,mod-2)%mod*o1)%mod);
}
int  gd(int o,int p)//分别的筹码
{   
    if(p==0)
    return 1;
    else if(o==0)
    return 1;
    if(o>p)
    {
       int o1=nt(a,c);
       int p1=nt(b,c);
       o1%=mod;
       p1%=mod;
       int  ss=o/p;
       if(o%p==0)
       ss--;
       int ssum=0;
       ssum=(o1*(1-(ksm(p1,ss)%mod)))%mod;
       ssum=ssum*(ksm(1-p1,mod-2))%mod;
       int sum=o%p;
       int num=ksm(p1,ss)%mod;
       if(o%p==0)
        sum=o;
        return (ssum+num*gd(o,sum))%mod;
    }
    else if(o==p)
    {
      int o1=nt(a,c);
       int p1=nt(b,c);
       return o1;
    }
    else
    {
      int ci=p/o;
      int o1=ksm(a,ci)%mod;
      int p1=ksm(c,ci)%mod;
      o1=nt(o1,p1);
      o1%=mod;
      return (o1*gd(o,p%o))%mod;;
    }
}
void solve()
{
   cin >> x >> y >> a >> b >> c;
   c=a+b;
   int ans=0;
  ans=gd(x,y);
  cout <<ans<<'\n';

}
signed main()
{
    int t;
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin >> t;
    while( t -- )
    {
      solve();
    }

}