#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using i128 = __int128;
using u128 = unsigned __int128;
template <typename T>
void chkmax(T &x, const T &y) {
  if (x < y) x = y;
}
template <typename T>
void chkmin(T &x, const T &y) {
  if (y < x) x = y;
}
constexpr int MOD = 998244353;
int add(int x, int y) {
  x += y;
  return x >= MOD ? x - MOD : x;
}
void inc(int &x, int y) {
  x += y;
  if (x >= MOD) x -= MOD;
}
void dec(int &x, int y) {
  x -= y;
  if (x < 0) x += MOD;
}
int adj(int x) { return x < 0 ? x + MOD : x; }
int neg(int x) { return x ? MOD - x : 0; }
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;
}
constexpr int MAXDIS = 610, MAXK = 105;
int n, m, k, r, c, v, C[MAXDIS][MAXDIS];
pair<int, int> wys[MAXK][MAXK];
int calc(int dx, int dy) {
  if (dx < 0 || dy < 0) return 0;
  return C[dx + dy][dx];
}
namespace gs {
constexpr int MAXN = 105;
int mat[MAXN][MAXN];
int det(int n) {
  int ret = 1;
  for (int i = 0; i < n; ++i) {
    if (!mat[i][i]) {
      for (int j = i + 1; j < n; ++j) {
        if (mat[j][i]) {
          swap_ranges(mat[i] + i, mat[i] + n, mat[j] + i);
          ret = neg(ret);
          break;
        }
      }
      if (!mat[i][i]) return 0;
    }
    ret = (ll)ret * mat[i][i] % MOD;
    int inv = qpow(mat[i][i], MOD - 2);
    for (int j = i + 1; j < n; ++j) {
      int coef = (ll)mat[j][i] * inv % MOD;
      for (int k = i; k < n; ++k)
        mat[j][k] = adj((mat[j][k] - (ll)coef * mat[i][k]) % MOD);
    }
  }
  return ret;
}
}  // namespace gs
namespace lgr {
constexpr int MAXN = 105;
int y[MAXN], ans[MAXN], f[MAXN], g[MAXN];
void idft(int n) {
  f[0] = 1;
  for (int i = 0; i < n; ++i) {
    for (int j = i + 1; j >= 1; --j)
      f[j] = adj((f[j - 1] - (ll)i * f[j]) % MOD);
    f[0] = (ll)f[0] * (MOD - i) % MOD;
  }
  for (int i = 0; i < n; ++i) {
    for (int j = n - 1; j >= 0; --j) g[j] = (f[j + 1] + (ll)i * g[j + 1]) % MOD;
    int coef = 1;
    for (int j = 0; j < n; ++j)
      if (j != i) coef = (ll)coef * (i - j + MOD) % MOD;
    coef = (ll)y[i] * qpow(coef, MOD - 2) % MOD;
    for (int j = 0; j < n; ++j) ans[j] = (ans[j] + (ll)g[j] * coef) % MOD;
  }
}
}  // namespace lgr
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  for (int i = 0; i < MAXDIS; ++i) {
    C[i][0] = 1;
    for (int j = 1; j <= i; ++j) C[i][j] = add(C[i - 1][j - 1], C[i - 1][j]);
  }
  cin >> n >> m >> k >> r >> c >> v;
  r += v - 2;
  c += v - 2;
  for (int i = 0; i < k - 1; ++i) {
    for (int j = 0; j < k - 1; ++j) {
      int sx = n + i, sy = i, tx = j, ty = m + j;
      if (sx < tx || sy > ty) continue;
      if (r > sx || c > ty) {
        wys[i][j] = {calc(sx - tx, ty - sy), 0};
        continue;
      }
      if (r < tx || c < sy) {
        wys[i][j] = {0, calc(sx - tx, ty - sy)};
        continue;
      }
      wys[i][j].second = adj((calc(sx - tx, ty - sy) -
                              (ll)calc(sx - r, c - sy) * calc(r - tx, ty - c)) %
                             MOD);
      for (int p = tx; p < r; ++p) {
        int tmp = (ll)calc(sx - p, c - 1 - sy) * calc(p - tx, ty - c) % MOD;
        dec(wys[i][j].second, tmp);
        inc(wys[i][j].first, tmp);
      }
    }
  }
  for (int x = 0; x < k; ++x) {
    for (int i = 0; i < k - 1; ++i) {
      for (int j = 0; j < k - 1; ++j)
        gs::mat[i][j] = ((ll)x * wys[i][j].first + wys[i][j].second) % MOD;
    }
    lgr::y[x] = gs::det(k - 1);
  }
  lgr::idft(k);
  cout << lgr::ans[v - 1] << "\n";
  return 0;
}
/*
g++ B.cpp -o B -std=c++14 -O2 -Wall -Wextra -Wshadow -g
-fsanitize=address,undefined
*/