#include <bits/stdc++.h>
using namespace std;
const int MAXN = 305, P = 998244353;
int n, m, k, r, c, v;
int fac[MAXN << 1], inv[MAXN << 1];
int qpow(int a, int b) {
    int ans = 1;
    while (b) {
        if (b & 1) ans = 1ll * ans * a % P;
        a = 1ll * a * a % P;
        b >>= 1;
    }
    return ans;
}
void init(int n) {
    fac[0] = 1;
    for (int i = 1; i <= n; i++)
        fac[i] = 1ll * fac[i - 1] * i % P;
    inv[n] = qpow(fac[n], P - 2);
    for (int i = n; i >= 1; i--)
        inv[i - 1] = 1ll * inv[i] * i % P;
    assert(inv[0] == 1);
}
int C(int n, int m) {
    if (n < 0 || m < 0 || n < m) return 0;
    return 1ll * fac[n] * inv[m] % P * inv[n - m] % P;
}
int calc(int x1, int y1, int x2, int y2) {
    return C(x1 - x2 + y2 - y1, x1 - x2);
}
int f[MAXN][MAXN], fx[MAXN][MAXN];
int a[MAXN][MAXN];
int y[MAXN];
int det() {
    int ans = 1;
    for (int i = 0; i < k; i++) {
        int p = -1;
        for (int j = i; j < k; j++) if (a[j][i]) {
            p = j;
            break;
        }
        if (p == -1) return 0;
        if (p != i) ans *= -1, swap(a[i], a[p]);
        for (int j = i + 1; j < k; j++) {
            int inv = 1ll * a[j][i] * qpow(a[i][i], P - 2) % P;
            for (int l = i; l < k; l++) {
                a[j][l] = (a[j][l] - 1ll * inv * a[i][l] % P + P) % P;
            }
        }
    }
    for (int i = 0; i < k; i++)
        ans = 1ll * ans * a[i][i] % P;
    return (ans + P) % P;
}
int p[MAXN], q[MAXN];
int main() {
    init(600);
    scanf("%d%d%d%d%d%d", &n, &m, &k, &r, &c, &v);
    r += v - 2, c += v - 2, k--;
    for (int i = 0; i < k; i++) {
        for (int j = 0; j < k; j++) {
            f[i][j] = calc(n + i, i, j, m + j);
            for (int d = 0; r - d >= 0 && c - d >= 0; d++) {
                int x = 1ll * calc(n + i, i, r - d, c - d) * calc(r - d, c - d, j, m + j) % P;
                f[i][j] = (f[i][j] - x + P) % P;
                if (d) fx[i][j] = (fx[i][j] + x) % P;
            }
        }
    }
    for (int i = 0; i <= k; i++) {
        memset(a, 0, sizeof a);
        for (int x = 0; x < k; x++) {
            for (int y = 0; y < k; y++) {
                a[x][y] = (f[x][y] + 1ll * fx[x][y] * i) % P;
            }
        }
        y[i] = det();
    }
    int ans = 0;
    for (int i = 0; i <= k; i++) {
        memset(p, 0, sizeof p);
        p[0] = y[i];
        for (int j = 0; j <= k; j++) if (j != i) {
            int inv = qpow(j - i, P - 2);
            memset(q, 0, sizeof q);
            for (int l = 0; l <= k; l++) {
                q[l] = (q[l] + 1ll * j * inv % P * p[l] % P + P) % P;
                if (l) q[l] = (q[l] - 1ll * inv * p[l - 1] % P + P) % P;
            }
            memcpy(p, q, sizeof q);
        }
        ans = (ans + p[v - 1]) % P;
    }
    printf("%d\n", ans);
    return 0;
}