#include <bits/stdc++.h>
using namespace std;
#define BIT(n) (1LL << (n))
#define BITF(n, i) (((n) >> (i)) & 1)
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define REPI(i, x) for (int i = 1; i <= x; i++)
#define FORI(i, m, n) for (int i = m; i <= n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define REPZ(i, x) for (int i = 0; i <= x; i++)
#define FORA(i, n) for (auto &&i : n)
#define POW(a, b) ((int)(pow(a, b) + .5))
#define MODULO(a, b) (((a) % (b)) < 0 ? (a) % (b) + (b) : (a) % (b))
#define DUMPOUT cerr
// vector
template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
  for (T &x : vec) is >> x;
  return is;
}
// pair
template <typename T, typename U> ostream &operator<<(ostream &os, pair<T, U> &pair_var) {
  os << "(" << pair_var.first << ", " << pair_var.second << ")";
  return os;
}
// vector
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {
  os << "{";
  REP(i, (int)vec.size())
  os << vec[i] << (i + 1 == (int)vec.size() ? "" : ", ");
  os << "}";
  return os;
}
// map
template <typename T, typename U> ostream &operator<<(ostream &os, map<T, U> &map_var) {
  os << "{";
  FORA(itr, map_var) {
    os << *itr;
    itr++;
    if (itr != map_var.end()) os << ", ";
    itr--;
  }
  os << "}";
  return os;
}
// set
template <typename T> ostream &operator<<(ostream &os, set<T> &set_var) {
  os << "{";
  FORA(itr, set_var) {
    os << *itr;
    itr++;
    if (itr != set_var.end()) os << ", ";
    itr--;
  }
  os << "}";
  return os;
}
void dump_func() { DUMPOUT << endl; }
template <class Head, class... Tail> void dump_func(Head &&head, Tail &&... tail) {
  DUMPOUT << head;
  if (sizeof...(Tail) > 0) DUMPOUT << ", ";
  dump_func(std::move(tail)...);
}
#ifdef DEBUG_
#define DEB
#define DUMP(...)                                                             \
  DUMPOUT << "  " << string(#__VA_ARGS__) << ": "                             \
          << "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]" << endl \
          << "    ",                                                          \
      dump_func(__VA_ARGS__)
#define PRINTARR(x, y)                                     \
  cerr << #x << "=\n";                                     \
  for (auto itr = x; itr != y; itr++) cerr << *itr << " "; \
  cerr << endl;
#define PRINTARR2(x, i0, i1)                                       \
  cerr << #x << "=\n";                                             \
  for (int ii0 = 0; ii0 < i0; ii0++) {                             \
    for (int ii1 = 0; ii1 < i1; ii1++) cerr << x[ii0][ii1] << " "; \
    cerr << endl;                                                  \
  }
#else
#define DEB if (false)
#define DUMP(...)
#define PRINTARR(x, y)
#define PRINTARR2(x, i0, i1)
#endif
#define ALL(v) v.begin(), v.end()
#define fst first
#define snd second
#define mp make_pair
#define pb push_back
#define epb emplace_back
#define int long long
#define pint pair<int, int>
#define pdouble pair<double, double>
#define ld long double
using namespace std;
template <class T> bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T> bool chmin(T &a, const T &b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T> using vec = std::vector<T>;
template <class T> void print(const T &x) { cout << x << "\n"; }
const int MOD = 998244353, INF0 = 1061109567, INF = INF0 * INF0;
const double EPS = 1e-7, PI = acos(-1.0);
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
/*
[&] { return; }();下のスラッシュを2つ追加しただけ.上のスラッシュを2つにすれば外れる.
//*/
int binpow(int a, int b, int mo) {
  if (a >= mo) a %= mo;
  int ans = 1;
  do {
    if (b & 1) ans = 1ll * ans * a % mo;
    a = 1ll * a * a % mo;
  } while (b >>= 1);
  return ans;
}
int modInv(int p) {
  if (p >= MOD) p %= MOD;
  return binpow(p, MOD - 2, MOD);
}
// ncr使うならbinpowまで
const int FACTSIZE = 100100;
int fact[FACTSIZE];
int revfact[FACTSIZE];
void init() {
  fact[0] = 1, revfact[0] = 1;
  for (int i = 1; i < FACTSIZE; ++i) {
    fact[i] = fact[i - 1] * i % MOD;
    revfact[i] = binpow(fact[i], MOD - 2, MOD);
  }
}
int ncr(int n, int r) {
  if (n < r) return 0;
  int rs = fact[n] * revfact[r];
  if (rs >= MOD) rs %= MOD;
  rs *= revfact[n - r];
  if (rs >= MOD) rs %= MOD;
  return rs;
}

#define MAXN 3030
int dp[MAXN][MAXN];

typedef tuple<int, int, int, int> i4;
map<i4, int> ma;
int dfs(int v0, int v1, int v2, int v3) {
  i4 ele = make_tuple(v0, v1, v2, v3);
  if (ma.count(ele)) return ma[ele];
  if (v0 == v2) return ma[ele] = binpow(v0, v3 - v1, MOD);
  if (v1 == v3) return ma[ele] = binpow(v1, v2 - v0, MOD);
  int ans = 0;
  FORI(i, v0, v2) {
    ans += (i == 0 ? v0 : (1 * binpow(v1, i - v0, MOD)) * dfs(v1 + 1, i, v3, v2)) % MOD;
    ans %= MOD;
  }
  return ma[ele] = ans;
}

signed main() {
  init();

  cin.tie(0), ios::sync_with_stdio(false);
  cout << fixed << setprecision(12);
  int A, B, C, D, dAC, dBD;
  cin >> A >> B >> C >> D;
  dp[A][B] = 1;
  FORI(i, B + 1, D) dp[A][i] = (dp[A][i - 1] * A) % MOD;
  FORI(i, A + 1, C) dp[i][B] = (dp[i - 1][B] * B) % MOD;
  FORI(i, A + 1, C) {
    FORI(j, B + 1, D) {
      int v2 = dp[i - 1][j - 1];
      int v0 = dp[i - 1][j] + (MOD - ((i - 1) * v2) % MOD);
      v0 %= MOD;
      int v1 = dp[i][j - 1] + (MOD - ((j - 1) * v2) % MOD);
      v1 %= MOD;
      int val = (i - 1) * (j - 1) + (i - 1) + (j - 1);
      dp[i][j] += (v0 * j) % MOD;
      dp[i][j] += (v1 * i) % MOD;
      dp[i][j] += (v2 * val) % MOD;
      dp[i][j] %= MOD;
      DUMP(i, j, dp[i][j], v0, v1, v2);
    }
  }
  print(dp[C][D]);
  return 0;
  // int ans = 0;
  // ans = dfs(A, B, C, D);
  dAC = C - A;
  dBD = D - B;
  map<int, int> ma;
  int ret = C + D - (A + B);
  int area = dAC * dBD;
  ma[0] = 1;
  REPI(i, ret) {
    ma[i] = ma[i - 1];
    int ret = ((area + 1 - i) * modInv(i)) % MOD;
    ma[i] *= ret;
    ma[i] %= MOD;
    DUMP(area, i, ma[i]);
  }
  int ans = 0;
  REPZ(i, dAC) {
    int v0 = ncr(dAC, i);
    v0 *= binpow(B, i, MOD);
    v0 %= MOD;
    REPZ(j, dBD) {
      int v1 = ncr(dBD, j);
      v1 *= binpow(A, j, MOD);
      v1 %= MOD;
      int area = dAC * dBD;
      int remain = ret - i - j;
      if (remain >= 0 && remain <= area) {
        int tmp = (v0 * v1) % MOD;
        ans += (tmp * ncr((dAC - i) * (dBD - j), remain)) % MOD;
        DUMP(dAC, dBD, area, i, j, remain, v0, v1, ma[remain]);
        ans %= MOD;
      }
    }
  }
  //  int ans = dfs(A, B, C, D);
  print(ans);
}

Measured memory_bytes: 76128