#include<bits/stdc++.h>
#define pii pair<int,int>
#define pll pair<long long,long long>
#define endl "\n"
//#define int long long
#define ll long long
#define db double
#define ull unsigned long long
const int N = 100000+10;
const int inf = 2147483647;
const int mod = 998244353;
using namespace std;

ll ksm(ll a,ll b) {
    ll ans = 1;
    while (b){
        if (b&1) ans = ans*a%mod;
        a = a*a%mod;
        b >>= 1;
    }
    return ans%mod;
}

void solve() {
    ll x,y,a0,a1,b;
    cin >> x >> y >> a0 >> a1 >> b;
    b = a0+a1;
    ll ans = 0,pro = 1;
    while (x&&y){
        if (x >= y){
            ll cnt1 = x/y,cnt2 = x%y;
            ll tmp = (ksm(a1,cnt1)%mod*ksm(ksm(b,cnt1),mod-2)%mod)%mod;
            tmp = (1-tmp+mod)%mod;
            tmp = pro*tmp%mod;
            ans = (ans+tmp)%mod;
            pro = pro*tmp%mod;
            x = cnt2;
        }
        else{
            ll cnt1 = y/x,cnt2 = y%x;
            ll tmp = (ksm(a0,cnt1)%mod*ksm(ksm(b,cnt1),mod-2)%mod)%mod;
            if (cnt2 == 0){
                ans = (ans+tmp*pro%mod)%mod;
                break;
            }
            pro = pro*tmp%mod;
            y = cnt2;
        }
    }
    cout << ans << endl;
}

int main() {
    cout << fixed << setprecision(8);
    ios::sync_with_stdio(false);
    cin.tie(nullptr),cout.tie(nullptr);
    int t = 1;
    cin >> t;
    while (t--) solve();
}