#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define elif else if
#define sp(x) fixed << setprecision(x)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
//const ll MOD = 1e9+7;
const ll MOD = 998244353;
const int inf = (1<<30)-1;
const ll INF = (1LL<<60)-1;
const ld EPS = 1e-10;
template<typename T> bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;};
template<typename T> bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;};

template<ll mod> struct Mod_Int{
    ll x;
    Mod_Int() {}
    Mod_Int(ll y) : x (y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}

    Mod_Int &operator += (const Mod_Int &p) {
        x = (x + p.x) % mod;
        return *this;
    }

    Mod_Int &operator -= (const Mod_Int &p) {
        x = (x + mod - p.x) % mod;
        return *this;
    }

    Mod_Int &operator *= (const Mod_Int &p) {
        x = (x * p.x) % mod;
        return *this;
    }

    Mod_Int &operator /= (const Mod_Int &p) {
        *this *= p.inverse();
        return *this;
    }

    Mod_Int &operator ++ () {return *this += (Mod_Int)1;}

    Mod_Int operator ++ (int) {
        Mod_Int tmp = *this;
        ++*this;
        return tmp;
    }

    Mod_Int &operator -- () {return *this -= (Mod_Int)1;}

    Mod_Int operator -- (int) {
        Mod_Int tmp = *this;
        --*this;
        return tmp;
    }

    Mod_Int operator - () const {return Mod_Int(-x);}

    Mod_Int operator + (const Mod_Int &p) const {return Mod_Int(*this) += p;}

    Mod_Int operator - (const Mod_Int &p) const {return Mod_Int(*this) -= p;}

    Mod_Int operator * (const Mod_Int &p) const {return Mod_Int(*this) *= p;}

    Mod_Int operator / (const Mod_Int &p) const {return Mod_Int(*this) /= p;}

    bool operator == (const Mod_Int &p) const {return x == p.x;}

    bool operator != (const Mod_Int &p) const {return x != p.x;}

    Mod_Int pow (ll n) const {
        Mod_Int now = *this, ret = 1;
        while(n > 0){
            if(n & 1) ret *= now;
            now *= now, n >>= 1;
        }
        return ret;
    }

    Mod_Int inverse () const {
        return pow(mod-2);
    }
};

using mint = Mod_Int<MOD>;
const int MAX_N = 1e6;
mint fac[MAX_N+1], ifac[MAX_N+1];

void init(){
    fac[0] = 1;
    rep2(i, 1, MAX_N){
        fac[i] = fac[i-1]*i;
    }
    ifac[MAX_N] = fac[MAX_N].inverse();
    rep3(i, MAX_N, 1){
        ifac[i-1] = ifac[i]*i;
    }
}

mint comb(int n, int k){
    return fac[n]*ifac[n-k]*ifac[k];
}

mint perm(int n, int k){
    return fac[n]*ifac[n-k];
}

int main(){
    int A, B, C, D;
    cin >> A >> B >> C >> D;
    mint dp1[C+1][D+1], dp2[C+1][D+1], dp3[C+1][D+1];
    fill(dp1[0], dp1[C+1], 0);
    fill(dp2[0], dp2[C+1], 0);
    fill(dp3[0], dp3[C+1], 0);
    dp1[A][B] = 1;
    rep2(i, A, C){
        rep2(j, B, D){
            if(i == A && j == B) continue;
            elif(i == A){
                dp1[i][j] += dp1[i][j-1]*(i-1);
                dp2[i][j] += dp1[i][j-1] + dp2[i][j-1]*i;
            }
            elif(j == B){
                dp1[i][j] += dp1[i-1][j]*(j-1);
                dp3[i][j] += dp1[i-1][j] + dp3[i-1][j]*j;
            }
            else{
                dp1[i][j] += (dp1[i-1][j-1]+dp2[i-1][j-1]+dp3[i-1][j-1])*(i-1)*(j-1);
                dp2[i][j] += dp1[i][j-1] + dp3[i][j-1] + dp2[i][j-1]*i;
                dp3[i][j] += dp1[i-1][j] + dp2[i-1][j] + dp3[i-1][j]*j;
            }
        }
    }
    cout << (dp1[C][D]+dp2[C][D]+dp3[C][D]).x << endl;
}

Measured memory_bytes: 214668