#include<iostream>
#include<cstdio>
#define int long long
#define mod 998244353
#define N 2000
using namespace std;
int read()
{
	char c=0;
	int sum=0;
	while (c<'0'||c>'9') c=getchar();
	while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
	return sum;
}
int n,m,k,s[N+1][N+1],s1[N+1][N+1],s2[N+1][N+1],C[N+1][N+1],A[N+1],S[N+1],T[N+1],inv[N+1];
long long fast_pow(long long a,int b)
{
	if (b==0) return 1;
	if (b&1) return fast_pow(a*a%mod,b/2)*a%mod;
	else return fast_pow(a*a%mod,b/2);
}
int F(int x1,int y1,int x2,int y2)
{
	if (x1<x2) return 0;
	if (y1>y2) return 0;
	return C[x1-x2+y2-y1][x1-x2];
}
int G(int x1,int y1,int x2,int y2,int X,int Y)
{
	if (x1<x2) return 0;
	if (y1>y2) return 0;
	if (Y>=y2) return F(x1,y1,x2,y2);
	long long res=0;
	for (int i=x2;i<=X;++i) res=(res+F(x1,y1,i,Y)*F(i,Y+1,x2,y2)%mod)%mod;
	return res;
}
int gauss(int x)
{
	long long st,res=1;
	for (int i=1;i<=k;++i)
		for (int j=1;j<=k;++j)
			s[i][j]=(s1[i][j]*x%mod+s2[i][j])%mod;
	for (int i=1;i<=k;++i)
	{
		for (int j=i+1;j<=k;++j)
			if (!s[i][i]&&s[j][i])
				swap(s[i],s[j]),res=-res;
		if (s[i][i])
		{
			for (int j=i+1;j<=k;++j)
			{
				st=s[j][i]*fast_pow(s[i][i],mod-2)%mod;
				for (int t=i;t<=k;++t) s[j][t]=(s[j][t]-s[i][t]*st%mod)%mod;
			}
		}
	}
	for (int i=1;i<=k;++i) res=res*s[i][i]%mod;
	return res;
}
void laguange()
{
	long long res;
	for (int i=0;i<=k+1;++i) S[i]=T[i]=0;
	S[0]=1;
	for (int i=1;i<=k+1;++i)
	{
		for (int j=k+1;j>=1;--j) S[j]=(S[j-1]-S[j]*i%mod)%mod;
		S[0]=-S[0]*i%mod;
	}
	for (int i=1;i<=k+1;++i)
	{
		S[0]=-S[0]*inv[i]%mod,res=1;
		for (int j=1;j<=k+1;++j) S[j]=(S[j-1]-S[j])*inv[i]%mod;
		for (int j=1;j<=k+1;++j)
		{
			if (j>i) res=-res*inv[j-i]%mod;
			if (i>j) res=res*inv[i-j]%mod;
		}
		for (int j=0;j<=k;++j) T[j]=(T[j]+S[j]*A[i]%mod*res%mod)%mod;
		for (int j=k+1;j>=1;--j) S[j]=(S[j-1]-S[j]*i%mod)%mod;
		S[0]=-S[0]*i%mod;
	}
	return;
}
int solve(int r,int c,int v)
{
	r+=max(v-2,0ll),c+=max(v-2,0ll);
	long long res=0;
    for (int i=1;i<=k;++i)
		for (int j=1;j<=k;++j)
		    s1[i][j]=G(n+(i-1),i-1,j-1,m+(j-1),r-1,c-1),s2[i][j]=(F(n+(i-1),i-1,j-1,m+(j-1))-s1[i][j])%mod;
	for (int i=1;i<=k+1;++i) A[i]=gauss(i);
	laguange();
	for (int i=v-1;i<=k;++i) res=(res+T[i])%mod;
	return res;
}
signed main()
{
	int r,c,v;
	n=read(),m=read(),k=read()-1,r=read(),c=read(),v=read(),C[0][0]=inv[1]=1;
	for (int i=2;i<=k+1;++i) inv[i]=inv[mod%i]*(-mod/i)%mod;
	for (int i=0;i<=N;++i) C[i][0]=1;
	for (int i=1;i<=N;++i)
		for (int j=1;j<=i;++j)
			C[i][j]=(C[i-1][j]+C[i-1][j-1])%mod;
	printf("%lld\n",((solve(r,c,v)-solve(r,c,v+1))%mod+mod)%mod);
	return 0;
}