#include <bits/stdc++.h>

using ll = long long;
const int N = 5e6 + 10;
const ll mod = 998244353;

int T, n, m, l, k;

ll fac[N], inv[N];
ll qpow(ll a, ll b, ll ret = 1){
	for( ; b; b >>= 1, a = a * a % mod) if(b & 1) ret = ret * a % mod;
	return ret;
}
void init(){
	fac[0] = 1;
	for(int i = 1; i < N; ++i) fac[i] = fac[i - 1] * i % mod;
	inv[N - 1] = qpow(fac[N - 1], mod - 2);
	for(int i = N - 2; i >= 0; --i) inv[i] = inv[i + 1] * (i + 1) % mod;
}
ll binom(int n, int m){
	if(n < m || n < 0 || m < 0) return 0;
	return fac[n] * inv[m] % mod * inv[n - m] % mod;
}
ll dn(int n, int k){
	return fac[n] * inv[n - k] % mod;
}

ll val[N], prod[N], iprod[N], f[N];
void solve(){
	std::cin >> n >> m >> l >> k;
	int lim = std::min({n, m, l});
	for(int i = 1; i <= lim; ++i) val[i] = (1ll * n * m * l - 1ll * (n - i) * (m - i) * (l - i)) % mod;
	prod[0] = 1;
	for(int i = 1; i <= lim; ++i) prod[i] = val[i] * prod[i - 1] % mod;
	iprod[lim] = qpow(prod[lim], mod - 2);
	for(int i = lim - 1; i >= 0; --i) iprod[i] = iprod[i + 1] * val[i + 1] % mod;
	for(int i = k; i <= lim; ++i) f[i] = dn(n, i) * dn(m, i) % mod * dn(l, i) % mod * iprod[i] % mod;
	ll ans = 0;
	for(int i = k; i <= lim; ++i){
		if((i - k) & 1) ans = (ans - binom(i, k) * f[i] % mod + mod) % mod;
		else ans = (ans + binom(i, k) * f[i]) % mod;
	}
	std::cout << ans << '\n';
}

int main(){
	std::cin >> T;
	init();
	while(T--) solve();
	return 0;
}