#include <bits/stdc++.h>

constexpr int N = 302;
constexpr int mod = 998244353;
constexpr int power(int n, int m) {
    int sum = 1;
    for (; m; m >>= 1, n = 1ll * n * n % mod)
        if (m & 1) sum = 1ll * sum * n % mod;
    return sum;
}

int n, m, k, r, c, v;
int ri[N][N], dw[N][N];
std::vector<std::pair<int, int>> e1, e2;
struct Val {int k, b;};
Val operator+(Val x, Val y) { return {(x.k + y.k) % mod, (x.b + y.b) % mod}; }
Val f[N][N];

bool vis[N][N];
Val dis[N][N];
void bfs(int s) {
    std::queue<std::pair<int, int>> que;
    for (int i = 0; i <= n; i++) for (int j = 0; j <= m; j++) {
        f[i][j] = {};
        vis[i][j] = 0;
    }
    f[e1[s].first][e1[s].second] = {0, 1};
    que.push(e1[s]);
    vis[e1[s].first][e1[s].second] = 1;
    while (que.size()) {
        auto [x, y] = que.front(); que.pop();
        if (x + 1 <= n) {
            if (dw[x][y] == -1) continue;
            if (dw[x][y]) f[x + 1][y] = f[x + 1][y] + Val{f[x][y].b, 0};
            else f[x + 1][y] = f[x + 1][y] + f[x][y];
            if (!vis[x + 1][y]) {
                que.push({x + 1, y});
                vis[x + 1][y] = 1;
            }
        }
        if (y + 1 <= m) {
            if (ri[x][y] == -1) continue;
            if (ri[x][y]) f[x][y + 1] = f[x][y + 1] + Val{f[x][y].b, 0};
            else f[x][y + 1] = f[x][y + 1] + f[x][y];
            if (!vis[x][y + 1]) {
                que.push({x, y + 1});
                vis[x][y + 1] = 1;
            }
        }
    }
    for (int i = 0; i < k; i++) 
        dis[s][i] = f[e2[i].first][e2[i].second];
}
using Mat = std::array<std::array<int, 102>, 102>;
Mat mat;

int main() {
    scanf("%d%d%d%d%d%d", &n, &m, &k, &r, &c, &v); 
    if (k == 1) {
        puts("1");
        return 0;
    }
    std::swap(r, c); r = m - r + 1; std::swap(n, m);
    k--;
    n += k, m += k, r += k;
    r -= v - 1, c += v - 1;
    for (int i = 1; i <= k; i++) {
        e1.push_back({k - i, i});
        e2.push_back({n - i, m - k + i});
    }
    dw[r - 1][c] = ri[r - 1][c - 1] = -1;
    for (int x = r, y = c - 1; x <= n && y >= 0; x++, y--) ri[x][y] = dw[x][y] = 1;
    for (int i = 0; i < k; i++) bfs(i);
    std::vector<std::pair<int, int>> points;
    for (int cur = 0; cur <= k; cur++) {
        for (int i = 0; i < k; i++) for (int j = 0; j < k; j++)
            mat[i][j] = (1ll * cur * dis[i][j].k + dis[i][j].b) % mod;
        int res = 1;
        for (int i = 0; i < k; i++) {
            int p = -1;
            for (int j = i; j < k; j++) if (mat[j][i]) {
                p = j;
                break;
            }
            if (p == -1) continue;
            if (p != i) {
                std::swap(mat[p], mat[i]);
                res *= -1;
            }
            int inv = power(mat[i][i], mod - 2);
            for (int j = 0; j < k; j++) {
                if (j == i) continue;
                int t = 1ll * inv * mat[j][i] % mod;
                for (int o = 0; o < k; o++)
                    mat[j][o] = (mat[j][o] - 1ll * t * mat[i][o]) % mod;
            }
        }
        for (int i = 0; i < k; i++) res = 1ll * res * mat[i][i] % mod;
        points.push_back({cur, (res + mod) % mod});
    }
    int ans[N] = {};
    for (int i = 0; i < points.size(); i++) {
        int cur[N] = {points[i].second};
        for (int j = 0; j < points.size(); j++) {
            if (i == j) continue;
            cur[0] = 1ll * cur[0] * power(points[i].first - points[j].first, mod - 2) % mod;
        }
        int t = 0;
        for (int j = 0; j < points.size(); j++) {
            if (i == j) continue;
            for (int o = t + 1; o >= 0; o--)
                cur[o] = ((o > 0 ? cur[o - 1] : 0) - 1ll * cur[o] * points[j].first) % mod;
            t++;
        }
        for (int i = 0; i <= t; i++)
            ans[i] = (ans[i] + cur[i]) % mod;
    }
    printf("%d\n", (ans[v - 1] + mod) % mod);
    return 0;
}