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

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

#define LL long long
// https://www.cnblogs.com/kyeecccccc/p/16926104.html
struct Mod
{
    LL m, p;
    void init(int pp) { m = ((__int128)1 << 64) / pp; p = pp; }
    LL operator ()(LL x)
    {
        return x - ((__int128(x) * m) >> 64) * p;
    }
} mod;

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

int main() {
    mod.init(998244353);
    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 = mod(1ll * (r + s) * mod(1ll * ans * inv[n * m + s + r + n]));
        printf("%d\n", ans);
    }
    return 0;
}