#include<bits/stdc++.h>
#define endl "\n"
using namespace std;
#define int long long
using ll = long long;
const int inf = 2e15+7, N = 3e5+5, mod = 998244353;
typedef pair<int, int> P;
int qpow(int a,int b,int c){
    int ans=1;
    while(b){
        if(b&1) ans=ans*a%c;
        b>>=1,a=a*a%c;
    }
    return ans;
}
int x,y,a,b,c;
int ans=1;
void dfs(int x, int y, int cur) {
    if(x == y) {
        ans = (ans + cur * a) % mod; 
        return ;
    } else if(x < y) {
        int d = (y - 1) / x;
        dfs(x, y - d * x, cur * qpow(a, d,mod) % mod);
    } else {
        int d = (x - 1) / y;
        ans = (ans + cur * (1 - qpow(b, d,mod) + mod)) % mod;
        dfs(x - d * y, y, cur * qpow(b, d,mod) % mod);
    }
}
void solve(){
    cin>>x>>y>>a>>b>>c;
    int s=qpow(a+b,mod-2,mod);
    a=a*s%mod,b=b*s%mod;
    ans=1;
    dfs(x,y,1);
    cout<<ans<<endl;
    return;
}

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