#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll const m = 998244353;
ll mpow(ll a, ll n) {
	ll ret = 1;
	while (n) {
		if (n & 1) ret = (ret * a) % m;
		a = (a * a) % m;
		n >>= 1;
	}
	return ret;
}
int main () {
	int X, Y, Z, W;
	cin >> X >> Y >> Z >> W;
	if (W == 0) {
		swap(X, Y); swap(Z, W);
	}
	int dx = X - Z - 1, dy = Y - W;
	ll kai[600020], fkai[600020];
	kai[0] = 1;
	for (int i = 1; i <= dx + dy; i ++) {
		kai[i] = (kai[i - 1] * i) % m;
	}
	fkai[dx + dy] = mpow(kai[dx + dy], m - 2);
	for (int i = dx + dy; i > 0; i --) {
		fkai[i - 1] = (fkai[i] * i) % m;
	}
	ll ans = kai[dx + dy];
	ans = (ans * fkai[dx]) % m;
	ans = (ans * fkai[dy]) % m;
	cout << ans << endl;
}