#include <iostream>
#include <string>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <unordered_map>
#include <map>
#include <set>
#include <algorithm>
#include <queue>
#include <stack>
#include <functional>
#include <bitset>
#include <assert.h>
#include <unordered_map>
#include <fstream>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<char> vc;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef pair<ll,ll> P;
typedef pair<int,int> pii;
typedef vector<P> vpl;
typedef tuple<ll,ll,ll> tapu;
#define rep(i,n) for(int i=0; i<(n); i++)
#define REP(i,a,b) for(int i=(a); i<(b); i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
const int inf = 1<<30;
const ll linf = 1LL<<62;
const int MAX = 510000;
ll dy[8] = {1,-1,0,0,1,-1,1,-1};
ll dx[8] = {0,0,1,-1,1,-1,-1,1};
const double pi = acos(-1);
const double eps = 1e-7;
template<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){
	if(a>b){
		a = b; return true;
	}
	else return false;
}
template<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){
	if(a<b){
		a = b; return true;
	}
	else return false;
}
template<typename T> inline void print(T &a){
    rep(i,a.size()) cout << a[i] << " ";
    cout << "\n";
}
template<typename T1,typename T2> inline void print2(T1 a, T2 b){cout << a << " " << b << "\n";}
template<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){
	cout << a << " " << b << " " << c << "\n";
}
//const int mod = 1e9 + 7;
const int mod = 998244353;

template <std::uint_fast64_t Modulus> class modint {
  using u64 = std::uint_fast64_t;

public:
  u64 a;

  constexpr modint(const u64 x = 0) noexcept : a(x % Modulus) {}
  constexpr u64 &value() noexcept { return a; }
  constexpr const u64 &value() const noexcept { return a; }
  constexpr modint operator+(const modint rhs) const noexcept {
	return modint(*this) += rhs;
  }
  constexpr modint operator-(const modint rhs) const noexcept {
	return modint(*this) -= rhs;
  }
  constexpr modint operator*(const modint rhs) const noexcept {
	return modint(*this) *= rhs;
  }
  constexpr modint operator/(const modint rhs) const noexcept {
	return modint(*this) /= rhs;
  }
  constexpr modint &operator+=(const modint rhs) noexcept {
	a += rhs.a;
	if (a >= Modulus) {
	  a -= Modulus;
	}
	return *this;
  }
  constexpr modint &operator-=(const modint rhs) noexcept {
	if (a < rhs.a) {
	  a += Modulus;
	}
	a -= rhs.a;
	return *this;
  }
  constexpr modint &operator*=(const modint rhs) noexcept {
	a = a * rhs.a % Modulus;
	return *this;
  }
  constexpr modint &operator/=(modint rhs) noexcept {
	u64 exp = Modulus - 2;
	while (exp) {
	  if (exp % 2) {
		*this *= rhs;
	  }
	  rhs *= rhs;
	  exp /= 2;
	}
	return *this;
  }
};

using mint = modint<mod>;

vector<ll> fac(MAX), finv(MAX), inv(MAX);

void comInit(){
	fac[0] = fac[1] = 1;
	finv[0] = finv[1] = 1;
	inv[1] = 1;
	for(ll i=2; i<MAX; i++){
		fac[i] = fac[i-1]*i % mod;
		inv[i] = mod - inv[mod%i] * (mod/i) % mod;
		finv[i] = finv[i-1] * inv[i] % mod;
	}
}


ll com(ll n, ll k){
	if(n < k) return 0;
	if(n < 0 || k < 0) return 0;
	return fac[n] * (finv[k] * finv[n-k] % mod) % mod;
}

mint dp[3005][3005][3][3];

int main(){
	ll a,b,c,d; cin >> a >> b >> c >> d;
	dp[a][b][0][0] = 1;
	comInit();
	REP(i,a,c+1){
		REP(j,b,d+1){
			if(i==a && j==b) continue;
			if(i==a){
				rep(k,3){
					rep(l,3){
						dp[i][j][k][1] += dp[i][j-1][k][l] * (i-1);
						dp[i][j][min(k+1,2)][1] += dp[i][j-1][k][l];
					}
				}
			}
			else if(j==b){
				rep(k,3){
					rep(l,3){
						dp[i][j][1][l] += dp[i-1][j][k][l] * (j-1);
						dp[i][j][1][min(2,l+1)] += dp[i-1][j][k][l];
					}
				}
			}else{
				rep(k,3) dp[i][j][0][1] += dp[i][j-1][0][k] * (i-1);
				rep(k,3) dp[i][j][1][0] += dp[i-1][j][k][0] * (j-1);
				rep(k,3){
					dp[i][j][1][1] += dp[i-1][j][k][1] * (j-1);
					dp[i][j][1][1] += dp[i][j-1][1][k] * (i-1);
				}
				dp[i][j][1][1] *= inv[2];
				//dp[i][j][1][1] += dp[i-1][j][2][1] * (j-1);
				//dp[i][j][1][1] += dp[i][j-1][1][2] * (i-1);
				rep(k,3){
					dp[i][j][1][1] += dp[i][j-1][0][k];
					dp[i][j][1][1] += dp[i-1][j][k][0];
				}
				rep(k,3){
					dp[i][j][1][2] += dp[i-1][j][k][1];
					dp[i][j][1][2] += dp[i-1][j][k][2] * j;
				}
				rep(k,3){
					dp[i][j][2][1] += dp[i][j-1][1][k];
					dp[i][j][2][1] += dp[i][j-1][2][k] * i;
				}
				mint minus = 0;
			}
		}
	}
	mint ans = 0;
	rep(k,3) rep(l,3) ans += dp[c][d][k][l];
	cout << ans.value() << "\n";
}

Measured memory_bytes: 648552