#include <bits/stdc++.h>

const int mod = 998244353;

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

int T, x, y, fz, fm;

int solve(int x, int y, int cnt1, int cnt2) {
  // std::cout << x << " " << y << " " << cnt1 << " " << cnt2 << '\n';
  if (y == 0) return (1ll * qpow(fz, cnt1) * qpow(qpow(fm, cnt1), mod - 2) % mod) * (1ll * qpow(fm - fz, cnt2) * qpow(qpow(fm, cnt2), mod - 2) % mod) % mod;
  if (x == 0) return 0;
  if (x >= y) {
    int ad = (x - 1) / y;
    int prt1 = (1ll * qpow(fz, cnt1 + 1) * qpow(qpow(fm, cnt1 + 1), mod - 2) % mod) * (1ll * qpow(fm - fz, cnt2) * qpow(qpow(fm, cnt2), mod - 2) % mod) % mod;
    int prt2 = (1ll * fm * qpow(fz, mod - 2) % mod - 1ll * qpow(fm - fz, ad + 1) * qpow(1ll * fz * qpow(fm, ad) % mod, mod - 2) % mod + mod) % mod;
    return (1ll * prt1 * prt2 % mod + solve(x % y, x, cnt1, cnt2 + ad)) % mod;
  } else return solve(x, y % x, cnt1 + y / x, cnt2);
}

int main() {
  scanf("%d", &T);
  while (T--) {
    int tmp;
    scanf("%d %d", &x, &y);
    scanf("%d %d %d", &fz, &fm, &tmp);
    fm += fz;
    if (fz == 0) puts("0");
    else printf("%d\n", solve(x, y, 0, 0));
  }
  return 0;
}