#include <bits/stdc++.h>
using namespace std;

const int N = 30000005;
const int P = 998244353;

#define ll long long
#define ld long double

// https://yhx-12243.github.io/OI-transit/templates.html

inline ll MulMod(ll a, ll b) {
	ll t = (a * b - (ll)((ld)a * b / P) * P) % P;
	return t + (t >> 63 & P);
}

int fac[N], ifac[N];
inline int qpow(int a, int b = P - 2) {
    int res = 1;
    while (b) {
        if (b & 1) res = MulMod(res, a);
        a = MulMod(a, a);
        b >>= 1;
    }
    return res;
}
inline void init(int n) {
    fac[0] = 1;
    for (int i = 1; i <= n; i++) fac[i] = MulMod(fac[i - 1], i);
    ifac[n] = qpow(fac[n]);
    for (int i = n - 1; i >= 0; i--) ifac[i] = MulMod(ifac[i + 1], i + 1);
}
inline int binom(int n, int m) {
    return 1ll * fac[n] * ifac[m] % P * ifac[n - m] % P;

}

int main() {
    init(3e7);
    int T; scanf("%d", &T);
    while (T--) {
        int n, m, r, s;
        scanf("%d%d%d%d", &n, &m, &r, &s);
        int ans = binom(n * m + s + r + n, n);
        ans = 1ll * (r + s) * ans % P * qpow(n * m + s + r + n) % P;
        printf("%d\n", ans);
    }
    return 0;
}