#include <bits/stdc++.h>
using namespace std;
const int P = 998244353; 
const int N = 5e6 + 5; 

inline int poww(int a, int b) {
    if (a == -1) return b % 2 == 0 ? 1 : -1; 
    int r = 1; 
    for (; b; b >>= 1, a = 1ll * a * a % P) if (b & 1) r = 1ll * r * a % P; 
    return r; 
}

int fac[N], ifac[N], inv[N], g[N];
inline void initFac(void) {
    for (int i = fac[0] = 1; i < N; ++i) fac[i] = 1ll * fac[i - 1] * i % P; 
    ifac[N - 1] = poww(fac[N - 1], P - 2); 
    for (int i = N - 2; i >= 0; --i) ifac[i] = 1ll * ifac[i + 1] * (i + 1) % P; 
    inv[1] = 1; 
    for (int i = 2; i < N; ++i) inv[i] = 1ll * (P - P / i) * inv[P % i] % P; 
}
inline int C(int n, int m) {
    return 1ll * fac[n] * ifac[m] % P * ifac[n - m] % P; 
}
inline int down(int n, int m) {
    return 1ll * fac[n] * ifac[n - m] % P; 
}

int main(void) {
    initFac(); 
    ios::sync_with_stdio(0); cin.tie(0); 
    int T; cin >> T; 
    while (T--) {
        int n, m, l, k; cin >> n >> m >> l >> k; 
        int s = min({n, m, l});
        int ans = 0;
        int pai = 1;
        for (int i = 1; i <= s; ++i)
            pai = 1ll * pai * (1ll * n * m % P * l % P - 1ll * (n - i) * (m - i) % P * (l - i) % P) % P;
        g[s] = poww(pai, P - 2);
        for (int i = s - 1; i >= 1; --i)
            g[i] = 1ll * g[i + 1] * (1ll * n * m % P * l % P - 1ll * (n - i - 1) * (m - i - 1) % P * (l - i - 1) % P) % P;
        for (int i = k; i <= s; ++i)
            ans = (ans + 1ll * poww(-1, i - k) * C(i, k) % P * down(n, i) % P * down(m, i) % P * down(l, i) % P * g[i]) % P; 
        cout << (ans + P) % P << "\n"; 
    }
    return 0;
}