//
// Created by zhouw on 24-9-21.
//
#include<bits/stdc++.h>
using namespace std;
#define int long long
const int MOD = 998244353;

const int N = 1e8;
int fact[N],infact[N];

int qpow(int a,int b)
{
    int res=1;
    for(;b;b/=2,a=1ll * a * a % MOD)
    {
        if(b % 2)
            res = 1ll * res * a % MOD;
    }
    return res;
}

void ini()
{
    fact[0] = infact[0] = 1;
    for(int i = 1 ; i < N ; i ++)
    {
        fact[i] = fact[i-1] * i % MOD;
        infact[i] = qpow(fact[i],MOD-2);
    }
}

int C(int a,int b)
{
    if(a < b) return 0;
    return fact[a] * infact[b] % MOD * infact[a-b] % MOD;
}

std::pair<int,int> win(int x,int y,int a0,int a1)
{
    int num;
    num = 1 + (y-x)/x + ((y-x)%x !=0);
    if(x >= y) num = 1;
    int zi = qpow(a0,num)%MOD;

    int y1 = y % x , x1 = x - y1;
    std::pair<int,int> res;
    if(x1 >= 1 && y1) res = win(x1,y1,a0,a1);
    else if(y1 == 1)
    {
        int in = 0;
        for(int i = 0 ; i <= num ; i ++)
        {
            in = (in + (qpow(a1,i)*qpow(a0+a1,num-i))%MOD)%MOD;
        }
        res = {x1 - y1,(in*a0)%MOD};
    }
    else res = {0,0};

    int zi1 = (qpow(a0,num-1)*a1)%MOD;

    num = num + res.first;
    zi1 = (zi1*res.second)%MOD;
    zi = (zi*qpow(a0+a1,res.first))%MOD;

    //std::cout << x << " " << y << " " << num << " " << (zi+zi1)%MOD << "\n";
    return {num,(zi+zi1)%MOD} ;
}

signed main()
{
    std::ios::sync_with_stdio(0);
    std::cin.tie(0);
    std::cout.tie(0);

    int t;
    cin>>t;
    while(t--)
    {
        int x,y;
        cin>>x>>y;
        int a0,a1,b;
        cin>>a0>>a1>>b;
        std::pair<int,int> www = win(x,y,a0,a1);
        int mu = qpow(a0+a1,www.first);
        int ans = (www.second*qpow(mu,MOD-2))%MOD;
        //std::cout << mu << " " << www.second << "\n";
        std::cout << ans << "\n";
    }
    //std::cout << MOD-2 << "\n";
    return 0;
}