#include<bits/stdc++.h>
using namespace std;
#define int long long
using LL = long long;
constexpr int mod = 998244353;

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

int n, k;
int x, y, a0, a1, b, c;
int num;
int ans1, ans2, inv, ans;

int get(int x){
    return x * inv % mod;
}

int dfs(int now1, int now2){
    if(now1 == now2){
        return get(a0);
    }else if(now1 < now2){
        int num = ((now2 - 1) / now1);
        if(now1 == now2 - num * now1){
            int cnt = ksm(get(a0), num + 1);
            return cnt;
        }else {
            int now = now2 - num * now1;
            return ksm(get(a0), num) * dfs(now1, now) % mod;
        }
    }else {
        int num = ((now1 - 1) / now2);
        if(now2 == now1 - num * now2){
            int cnt = ksm(inv, num + 1);
            int cc1 = ksm(c, num + 1);
            int cc2 = ksm(a1, num + 1);
            return cnt * (((cc1 - cc2) % mod + mod) % mod) % mod;
        }else {
            int now = now1 - num * now2;
            int cnt = ksm(inv, num);
            int cc1 = ksm(c, num);
            int cc2 = ksm(a1, num);
            return cnt * (((cc1 - cc2) % mod + mod) % mod) % mod * dfs(now, now2) % mod;
        }
    }
}

void Sakuya(){
    cin >> x >> y;
    cin >> a0 >> a1 >> b;
    inv = 1;
    c = a0 + a1;
    for(int i = 2; i <= sqrt(c); ++ i){
        while(c % i == 0){
            inv *= ksm(i, mod - 2);
            inv %= mod;
            c /= i;
        }
    }
    if(c){
        inv *= ksm(c, mod - 2);
        inv %= mod;
    }
    c = a1 + a0;
    cout << dfs(x, y) << "\n"; 
}

signed main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int T;
    for(cin >> T; T --; )
        Sakuya();
}