#include <bits/stdc++.h>
using namespace std;
#define debug(fmt, ...) \
  fprintf(stderr, "[%d] " fmt "\n", __LINE__, ##__VA_ARGS__)
template <class _Tx, class _Ty>
inline void chkmin(_Tx& x, const _Ty& y) { if (y < x) x = y; }
template <class _Tx, class _Ty>
inline void chkmax(_Tx& x, const _Ty& y) { if (x < y) x = y; }
bool Mbe;
using ll = long long;
constexpr int N = 1e3 + 10, mod = 998244353;
int n, m, k, px, py, pval, a[N][N], f[N], g[N], h[N], val[N], fac[N], ifac[N];
pair<int, int> b[N][N];
inline void add(int& x, int y) { x += y, x >= mod && (x -= mod); }
inline void sub(int& x, int y) { x -= y, x < 0 && (x += mod); }
inline int sum(int x, int y) { return x += y, x >= mod ? x - mod : x; }
inline int dif(int x, int y) { return x -= y, x < 0 ? x + mod : x; }
inline int neg(int x) { return x ? mod - x : 0; }
inline int bin(int n, int m) {
  if (n < m || m < 0) return 0;
  return (ll)fac[n] * ifac[m] % mod * ifac[n - m] % mod;
}
int qpow(int x, int y) {
  int ret = 1;
  for (; y; y >>= 1, x = (ll)x * x % mod)
    if (y & 1) ret = (ll)ret * x % mod;
  return ret;
}
pair<int,int> get_dp(int n, int m, int bx, int by) {
  if (n < 0 || m < 0) return make_pair(0, 0);
  static int dp[N][N][2];
  for (int i = 0; i <= n; ++i) {
    for (int j = 0; j <= m; ++j) {
      dp[i][j][0] = dp[i][j][1] = 0;
      if (!i && !j) dp[i][j][0] = dp[i][j][1] = 1;
      if (i) {
        add(dp[i][j][0], dp[i - 1][j][0]);
        add(dp[i][j][1], dp[i - 1][j][1]);
      }
      if (j) {
        add(dp[i][j][0], dp[i][j - 1][0]);
        add(dp[i][j][1], dp[i][j - 1][1]);
      }
      if (i > bx && j < by) dp[i][j][0] = 0;
      if (i < bx && j > by) dp[i][j][1] = 0;
      if (i == bx && j == by) dp[i][j][0] = dp[i][j][1] = 0;
    }
  }
  return make_pair(dp[n][m][0], dp[n][m][1]);
}
int det(int n) {
  int prd = 1;
  for (int i = 1; i <= n; ++i) {
    int p = i;
    for (int j = i; j <= n; ++j) if (a[j][i]) { p = j; break; }
    if (p != i) {
      prd = neg(prd);
      for (int j = i; j <= n; ++j) swap(a[i][j], a[p][j]);
    }
    if (!a[i][i]) return 0;
    prd = (ll)prd * a[i][i] % mod;
    int inv = qpow(a[i][i], mod - 2);
    for (int j = i; j <= n; ++j) a[i][j] = (ll)a[i][j] * inv % mod;
    for (int j = i + 1; j <= n; ++j) {
      int tmp = a[j][i];
      for (int k = i; k <= n; ++k) sub(a[j][k], (ll)a[i][k] * tmp % mod);
    }
  }
  return prd;
}
bool Med;
int main() {
  // debug("Mem: %.4lfMB.", fabs(&Med - &Mbe) / 1048576);
  cin.tie(0)->sync_with_stdio(0);
  cin >> n >> m >> k >> px >> py >> pval, --pval;
  fac[0] = ifac[0] = ifac[1] = 1;
  for (int i = 1; i < N; ++i) fac[i] = (ll)fac[i - 1] * i % mod;
  for (int i=  2; i < N; ++i) ifac[i] = (ll)ifac[mod % i] * (mod - mod / i) % mod;
  for (int i = 2; i < N; ++i) ifac[i] = (ll)ifac[i - 1] * ifac[i] % mod;
  for (int i = 1; i < k; ++i) {
    for (int j = 1; j < k; ++j) {
      int x1 = n + i - 1, y1 = i - 1;
      int x2 = j - 1, y2 = m + j - 1;
      int tx = px + pval - 1, ty = py + pval - 1;
      b[i][j] = get_dp(x1 - x2, y2 - y1, x1 - tx, ty - y1);
    }
  }
  g[0] = 1;
  for (int x = 1; x <= k; ++x) {
    for (int i = x; i >= 1; --i) g[i] = (g[i - 1] + (ll)g[i] * neg(x)) % mod;
    g[0] = (ll)g[0] * neg(x) % mod;
  }
  for (int x = 1; x <= k; ++x) {
    for (int i = 1; i < k; ++i) {
      for (int j = 1; j < k; ++j) {
        a[i][j] = ((ll)b[i][j].second * x + b[i][j].first) % mod;
      }
    }
    int y = det(k - 1), prd = 1;
    for (int i = 1; i <= k; ++i) if (i != x) prd = (ll)prd * dif(x, i) % mod;
    prd = (ll)y * qpow(prd, mod - 2) % mod;
    for (int i = k - 1; ~i; --i)
      h[i] = (g[i + 1] + (ll)h[i + 1] * x) % mod;
    for (int i = 0; i < k; ++i)
      f[i] = (f[i] + (ll)prd * h[i]) % mod;
  }
  cout << f[pval] << '\n';
  return 0;
}
/*
g++ -std=c++14 -O2 -o qoj-3082 qoj-3082.cpp -Wall -Wextra
-Wshadow -fsanitize=address,undefined -g
*/