#include<bits/stdc++.h>
#define pb push_back
#define ls (g<<1)
#define rs (g<<1|1)
#define md (l+r>>1)
#define Ls l,md,ls
#define Rs md+1,r,rs
#define ll long long
#define rll register ll
#define ull unsigned ll
#define D double
#define rd register D
#define eps 1e-10
#define ri register int
#define fi first
#define se second
#define pii pair<int,int>
#define cr(x) memset(x,0,sizeof(x))
#define fo(i,x,y) for(ri i=(x);i<=(y);i++)
#define fo2(i,x,y) for(ri i=(x);i>=(y);i--)
using namespace std;
const int N=405,p=998244353;
int n,m,k,r,c,V,a[N][N],xs[N];
int C[N][N],g[N],h[N],f[N][N],f2[N][N],ans;
inline int ksm(ri x,ri y){
	ri sm=1;
	for(;y;y>>=1,x=1ll*x*x%p)
	if(y&1)sm=1ll*sm*x%p;
	return sm;
}
inline int det(){
	ri s=1;
	fo(i,0,k-1){
		ri u=i;
		fo(j,i,k-1)if(a[j][i]){u=j;break;}
		if(u!=i){
			fo(j,0,k-1)swap(a[u][j],a[i][j]);
			s=-s;
		}
		if(!a[i][i])return 0;
		fo(j,i+1,k-1){
			ri o=1ll*ksm(a[i][i],p-2)*a[j][i]%p;
			fo(l,i,k-1)(a[j][l]-=1ll*a[i][l]*o%p)%=p;
		}
		s=1ll*s*a[i][i]%p;
	}
	return(s+p)%p;
}
inline int calc(ri x,ri y,ri xx,ri yy){
	ri d1=x-xx,d2=yy-y;
//	printf("%d %d\n",d1,d2);
	if(d1<0||d2<0)return 0;
	return C[d1+d2][d1];
}
int main(){
	scanf("%d%d%d%d%d%d",&n,&m,&k,&r,&c,&V);
	r+=V-2;c+=V-2;--k;C[0][0]=1;
	fo(i,1,400){
		C[i][0]=C[i][i]=1;
		fo(j,1,i-1)C[i][j]=(C[i-1][j]+C[i-1][j-1])%p;
	}
	fo(i,0,k-1)fo(j,0,k-1){
		f[i][j]=calc(n+i,i,j,m+j);
		fo(d,0,min(r,c)){
			ri o=1ll*calc(n+i,i,r-d,c-d)*calc(r-d,c-d,j,m+j)%p;
//			printf("%d %d %d %d %d %d\n",n+i,i,r-d,c-d,j,m+j);
//			printf("%d %d\n",calc(n+i,i,r-d,c-d),calc(r-d,c-d,j,m+j));
			(f[i][j]-=o)%=p;
			if(d)(f2[i][j]+=o)%=p;
		}
	}
	g[0]=1;
	fo(i,0,k){
		fo2(j,i+1,1)g[j]=(1ll*g[j]*(-i)%p+g[j-1])%p;
		g[0]=1ll*g[0]*(-i)%p;
//		fo(j,0,k+1)printf("%d ",g[j]);puts("");
	}
	fo(i,0,k){
		fo(j,0,k-1){
			fo(l,0,k-1){
				a[j][l]=(1ll*f2[j][l]*i%p+f[j][l])%p;
//				printf("%d %d\n",f[j][l],f2[j][l]);
//				printf("%d ",a[j][l]);
			}
//			puts("");
		}
		xs[i]=det();
//		printf("%d\n",xs[i]);
		fo(j,0,k){
			if(j!=i)xs[i]=1ll*xs[i]*ksm(i-j,p-2)%p;
		}
		if(!i){
			fo(j,0,k)h[j]=g[j+1];
		}
		else{
			ri o=ksm(-i,p-2);
			h[0]=1ll*g[0]*o%p;
			fo(j,1,k)h[j]=1ll*(g[j]-h[j-1])*o%p;
		}
//		fo(j,0,k)printf("%d ",h[j]);puts("");
		(ans+=1ll*xs[i]*h[V-1]%p)%=p;
	}
	printf("%d",(ans+p)%p);
}