F - Black and White Rooks

把n行分配给q1,q2,有fac[n] / fac[q1] * fac[q2] * fac[n - q1 - q2]; 防止算重，必须要求p*q每行每列至少有一个车。否则就不是p*q 如何求每一行每列至少有一个车？子问题 f(p, q) = C(n * m, b) - f(i, j) * C(p, i) * C(q, j); f(i, j)表示内部随便放 描述最终形式

问题特征:
	有很多种放法。但是最终形式是确定的

// Problem: F - Black and White Rooks
// Contest: AtCoder - AtCoder Beginner Contest 242
// URL: https://atcoder.jp/contests/abc242/tasks/abc242_f
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
// 2022-03-06 01:59:56
// 
// Powered by CP Editor (https://cpeditor.org)

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

#define rep(i,l,r) for(int i=(l);i<=(r);i++)
#define per(i,l,r) for(int i=(l);i>=(r);i--)
#define ll long long
#define pii pair<int, int>
#define mset(s,t) memset(s,t,sizeof(t))
#define mcpy(s,t) memcpy(s,t,sizeof(t))
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define mp make_pair

//const ll mod = 1e9 + 7;
const ll mod = 998244353;

inline ll qmi (ll a, ll b) {
	ll ans = 1;
	while (b) {
		if (b & 1) ans = ans * a%mod;
		a = a * a %mod;
		b >>= 1;
	}
	return ans % mod;
}
inline int read () {
	int x = 0, f = 0;
	char ch = getchar();
	while (!isdigit(ch)) f |= (ch=='-'),ch= getchar();
	while (isdigit(ch)) x = x * 10 + ch - '0', ch = getchar();
	return f?-x:x;
}
template<typename T> void print(T x) {
	if (x < 0) putchar('-'), x = -x;
	if (x >= 10) print(x/10);
	putchar(x % 10 + '0');
}
inline ll sub (ll a, ll b) {
	return ((a - b ) %mod + mod) %mod;
}
inline ll add (ll a, ll b) {
	return (a + b) %mod;
}
inline ll inv (ll a) {
	return qmi(a, mod - 2);
}

const int N =  10010;

ll n, m, b, w;
ll fac[N], infac[N];
ll p[110][110], q[110][110];
void init() {
	fac[0]  = infac[1] = 1;
	for (int i = 1; i <= n *m; i ++)
		fac[i] = fac[i - 1] * i %mod;
	infac[n * m ] = qmi(fac[n * m], mod - 2);
	for (int i = n * m; i >= 1; i --)
		infac[i - 1] = infac[i] * i %mod;
}
ll comb (ll a, ll b) {
	if (a < b || b < 0) return 0;
	return fac[a] * infac[b] %mod * infac[a - b] % mod;
}
void solve() {
	cin >> n >> m>> b >> w;
	init();
	rep (i, 1, n ) rep(j, 1, m) {
		p[i][j] = comb(i * j, b);
		rep(f1, 1, i ) rep(f2, 1, j) {
			if (f1 == i && f2 == j) continue;
			p[i][j] = ((p[i][j] - p[f1][f2] * comb(i, f1) %mod* comb(j, f2) %mod) %mod + mod) %mod;
		}
	}
	rep(i, 1, n ) rep(j, 1, m ) {
		q[i][j] = comb(i * j, w);
		rep(f1, 1, i)	 rep(f2, 1, j) {
			if (f1 == i && f2 == j) continue;//符合要求，所以不用减
			q[i][j] = ((q[i][j] - q[f1][f2] * comb(i, f1) % mod * comb(j, f2) %mod ) %mod + mod) %mod;
			//枚举实际的情况
		}
	}
	ll ans = 0;
	rep(f1, 1, n) rep(f2, 1, m )  rep(g1, 1, n ) rep(g2, 1, m) {
			if (f1  + g1 <= n && f2 + g2 <= m) {
				ans = ((ans + comb(n, f1) * comb(n - f1, g1) %mod * comb(m, f2) %mod * comb(m - f2, g2)
					%mod* p[f1][f2] %mod* q[g1][g2] %mod) %mod + mod)%mod;
			}
		}
	
	cout << (ans %mod + mod)%mod << endl;
}
int main () {
	// ios::sync_with_stdio(0),cin.tie(0), cout.tie(0);
    int t;
    t =1;
    //cin >> t;
    while (t --) solve();
    return 0;
}