#include <bits/stdc++.h>
#define LL long long
#define ULL unsigned long long
#define LLL __int128
#define pii pair<int, int>
#define pll pair<LL, LL>
#define pli pair<LL, int>
#define pil pair<int, LL>
#define fi first
#define se second
#define mkp make_pair
#define sz(x) (int)x.size()
#define ppc(x) __builtin_popcount(x)
#define pb push_back
using namespace std;
bool Med;

LL read() {
	LL s = 0, f = 1;
	char ch = getchar();
	while (ch < '0' || ch > '9')
		f = (ch == '-' ? -1 : 1), ch = getchar();
	while (ch >= '0' && ch <= '9')
		s = (s << 1) + (s << 3) + (ch ^ 48), ch = getchar();
	return s * f;
}

template<typename T> void chkmn(T &x, T y) {x = x > y ? y : x;}
template<typename T> void chkmx(T &x, T y) {x = x < y ? y : x;}

const int mod = 998244353;

int qpow(int a, int b) {
	int res = 1;
	while (b) {
		if (b & 1) res = 1ll * res * a % mod;
		a = 1ll * a * a % mod, b >>= 1;
	}
	return res;
}

auto fplus = [](int x, int y) {return x + y < mod ? x + y : x + y - mod;};
auto fminus = [](int x, int y) {return x >= y ? x - y : x + mod - y;};
auto Fplus = [](int &x, int y) {x = fplus(x, y);};
auto Fminus = [](int &x, int y) {x = fminus(x, y);};

#define N 600
int fac[N + 5], inv[N + 5];
void init() {
	fac[0] = 1;
	for (int i = 1; i <= N; i++) fac[i] = (LL)fac[i - 1] * i % mod;
	inv[N] = qpow(fac[N], mod - 2);
	for (int i = N; i; i--) inv[i - 1] = (LL)inv[i] * i % mod;
}
int C(int n, int m) { return n < m ? 0 : (LL)fac[n] * inv[m] % mod * inv[n - m] % mod;}
#undef N

int dp[305], val[305];

vector<int> chazhi(int *a, int n) {
	memset(dp, 0, sizeof dp);
	dp[0] = 1;
	for (int i = 1; i <= n; i++) {
		for (int j = i; j; j--) dp[j] = fminus(dp[j - 1], 1ll * dp[j] * i % mod);
		dp[0] = fminus(0, 1ll * dp[0] * i % mod);
	}
	vector<int> res(n);
	for (int i = 1; i <= n; i++) {
		int coef = a[i], inv = qpow(i, mod - 2);
		for (int j = 1; j <= n; j++)
			if (i != j) coef = 1ll * coef * qpow(fminus(i, j), mod - 2) % mod;
		dp[0] = 1ll * dp[0] * fminus(0, inv) % mod;
		for (int j = 1; j <= n; j++) dp[j] = 1ll * fminus(dp[j - 1], dp[j]) * inv % mod;
		for (int j = 0; j < n; j++) Fplus(res[j], 1ll * dp[j] * coef % mod);
		for (int j = n; j; j--) dp[j] = fminus(dp[j - 1], 1ll * dp[j] * i % mod);
		dp[0] = fminus(0, 1ll * dp[0] * i % mod);
	}
	return res;
}

int n, m, k, r, c, v, num = 0;
int f[105][105], g[105][105];

int calc(int x, int y, int xx, int yy) {
	if (xx > x || yy < y) return 0;
	return C(x - xx + yy - y, x - xx);
}

int a[105][105];

int det(int n) {
	int ans = 1;
	for (int i = 0; i < n; i++) {
		int mx = i;
		for (int j = i + 1; j < n; j++)
			if (a[j][i] > a[mx][i]) mx = j;
		if (!a[mx][i]) return 0;
		if (i != mx) swap(a[i], a[mx]), ans = fminus(0, ans);
		ans = 1ll * ans * a[i][i] % mod;
		int inv = qpow(a[i][i], mod - 2);
		for (int j = i + 1; j < n; j++) {
			int tmp = 1ll * inv * a[j][i] % mod;
			for (int k = i; k < n; k++) Fminus(a[j][k], 1ll * a[i][k] * tmp % mod);
		}
	}
	return ans;
}

bool Mst;
signed main() {
	n = read(), m = read(), k = read(), r = read(), c = read(), v = read(), init();
	r += v - 2, c += v - 2, k--, num = min(r, c);
	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 x = r, y = c; x >= 0 && y >= 0; x--, y--) {
				int t = 1ll * calc(n + i, i, x, y) * calc(x, y, j, m + j) % mod;
				Fminus(f[i][j], t);
				if (x != r) Fplus(g[i][j], t);
			}
		}
	for (int x = 1; x <= num + 1; x++) {
		for (int i = 0; i < k; i++)
			for (int j = 0; j < k; j++) a[i][j] = fplus(f[i][j], 1ll * g[i][j] * x % mod);
		val[x] = det(k);
	}
	vector<int> res = chazhi(val, num + 1);
	printf("%d\n", res[v - 1]);
	return 0;
}