//
//  main.cpp
//  zy_123
//
//  Created by 燃烧星空 on 2024/1/20.
//
//
//#include<bits/stdc++.h>
#include<iostream>
#include<map>
#include<unordered_map>
#include<set>
#include<cmath>
#include<vector>
#include<queue>
#include<deque>
#include<string>
#include<cstdlib>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<unordered_set>
#include<math.h>
#include<stack>
#include<stdint.h>
#include<bitset>
#include<fstream>
#include<random>
#include<chrono>
#include<time.h>
#define IOS cin.tie(0) -> sync_with_stdio(false), cout.tie(0);
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int N=2e5+5;
const int M=5e5+5;
const int inf=0x3f3f3f;
const ll INF=0x3f3f3f3f3f3f3f;
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pil pair<int,ll>
#define pli pair<ll,int>
#define lc p<<1
#define rc p<<1|1
#define lb(x) (x&(-x))
#define endl "\n"
double pai = acos(-1);
//const ll mod=1e9+7;
const ll mod=998244353;
#define int ll
//__int128 read_128()//c++20(64)可用
//{
//    __int128 x=0,f=1;char ch = getchar();
//    while(ch < '0' || ch > '9'){if(ch == '-') f=-1;ch=getchar();}
//    while(ch >= '0' && ch <= '9'){x = x * 10 + ch - '0';ch=getchar();}
//    return x*f;
//}
//void print_128(__int128 x)
//{
//    if(x<0){putchar('-');x=-x;}
//    if(x>9)print_128(x/10);
//    putchar(x % 10 + '0');
//}
//int idx=1,nxt[M*2],dian[M*2],h[N];
//ll quan[M*2];
////ll rong[M*2];
//int cur[N];
//void add(int a,int b,ll c)
//{
//    dian[++idx]=b;quan[idx]=c;
////    rong[idx]=c;
//    nxt[idx]=h[a];h[a]=idx;
//
//    dian[++idx]=a;quan[idx]=0;
////    rong[idx]=0;
//    nxt[idx]=h[b];h[b]=idx;
//}
//mt19937_64 rnd(chrono::steady_clock::now().time_since_epoch().count());
//ll ksm(ll a,ll b){ll sum=1;while(b){if(b&1){sum*=a;}a*=a;b>>=1;}return sum;}
ll ksm_mod(ll a,ll b,ll p){ll sum=1;while(b){if(b&1){sum=sum*a%p;}a=a*a%p;b>>=1;}return sum%p;}
//ll gsc(ll a,ll b,ll p){ll sum=0;while(b){if(b&1){sum=(sum+a)%p;}a=a*2%p;b>>=1;}return sum%p;}
//ll quick_mul(ll x,ll y,ll p){ll z=(long double)x/p*y;ll res=(ull)x*y-(ull)z*p;return (res+p)%p;}


ll n,m,q;
ll a,b,c;
ll inv(ll a)
{
    return ksm_mod(a,mod-2,mod)%mod;
}
ll gcd(ll x,ll y)
{
//    cout << x << " " << y << "\n";
    if(y<=0||x<=0)
    {
        return 0;
    }
    if(x>y)
    {
        ll cnt=x/y;
        ll ant=b*inv(a+b)%mod;
        ant=ksm_mod(ant,cnt,mod);
        ant=((1ll-ant)%mod+mod)%mod;
        return ant%mod;
    }
    else
    {
        ll cnt=y/x;
        if(y%x)
        {
            cnt++;
        }
        ll ans=0;
        ll ant=a*inv(a+b)%mod;
        ans=ksm_mod(ant,cnt,mod)%mod;
        ans=ans+ksm_mod(ant,cnt-1,mod)*gcd(x-y%x,y%x)%mod*b%mod*inv(a+b)%mod;
        return ans%mod;
    }
    
}
void solve()
{
    ll x,y;
    cin >> x >> y;
    cin >> a >> b >> c;
    cout << gcd(x,y)%mod << "\n";
}
signed main()
{
    IOS;
    int t=1;
    cin >> t;
    while(t--)
    {
        solve();
    }
    return 0;
}