#include<bits/stdc++.h>
using namespace std;
#define re register
#define debug(...) fprintf(stderr,__VA_ARGS__)
typedef long long ll;
typedef double db;
inline ll win(){
	ll x=0;bool w=0;char c=getchar();
	while(c>'9'||c<'0') w|=c=='-',c=getchar();
	while(c>='0'&&c<='9') x=(x<<1)+(x<<3)+(c^48),c=getchar();
	return w?-x:x;
}

const int N=333;
const ll mod=998244353ll;
struct qwe{
	int p,q;
	friend void operator +=(qwe &x,qwe y){x.p=(x.p+y.p)%mod,x.q=(x.q+y.q)%mod;}
	inline ll f(ll x){return (p+q*x)%mod;}
};

int n,m,v,rn,rm,px,py,pv,tid[N][N];
qwe f[N],sa[N][N];ll fac[N],inv[N],fin[N],a[N][N],vl[N],res[N],ans[N];

inline void sol(int sx,int sy,int sid){
//	debug("sol:%d %d %d\n",sx,sy,sid);
	for(re int i=1;i<=rn;++i) if(i==sx) f[i]=(qwe){py<sy,sy<=py};else f[i]=(qwe){0,0};
	for(re int j=sy;j<=rm;++j){
		if(j!=py) for(re int i=rn-1;i>=1;--i) f[i]+=f[i+1];
		else{
			f[px]=(qwe){0,0};
			for(re int i=1;i<px;++i) f[i].q=(f[i].q+f[i].p)%mod,f[i].p=0;
			for(re int i=px+1;i<=rn;++i) f[i].p=(f[i].p+f[i].q)%mod,f[i].q=0;
			for(re int i=rn-1;i>=1;--i) if(i!=px) f[i]+=f[i+1];
		}
//		for(re int i=1;i<=rn;++i) debug("(%d,%d)%c",f[i].q,f[i].p," \n"[i==rn]);
		for(re int i=1;i<=rn;++i) if(tid[i][j]) sa[sid][tid[i][j]]=f[i];
	}
}

inline void swpl(int x,int y,int i){for(;i<=n;++i) swap(a[x][i],a[y][i]);}
inline ll det(ll x){
	for(re int i=1;i<=n;++i) for(re int j=1;j<=n;++j) a[i][j]=sa[i][j].f(x);
	ll tmp=0;int fl=0;
	for(re int i=1,p;i<=n;++i){
		p=i;
		while(p<=n&&!a[p][i]) ++p;
		if(p>n) return 0;
		if(p!=i) swpl(p,i,i),fl^=1;
		for(re int j=i+1;j<=n;++j){
			if(a[j][i]>a[i][i]) swpl(j,i,i),fl^=1;
			while(a[j][i]){
				tmp=mod-a[i][i]/a[j][i];
				for(re int k=i;k<=n;++k)
					a[i][k]=(a[i][k]+a[j][k]*tmp)%mod;
				swpl(j,i,i),fl^=1;
			}
		}
	}
	tmp=1;
	for(re int i=1;i<=n;++i) tmp=tmp*a[i][i]%mod;
	return tmp?fl?mod-tmp:tmp:0;
}

inline void init(int l){
	fac[0]=inv[0]=inv[1]=fin[0]=1;
	for(re int i=1;i<=l;++i) fac[i]=fac[i-1]*i%mod;
	for(re int i=2;i<=l;++i) inv[i]=(mod-mod/i)*inv[mod%i]%mod;
	for(re int i=1;i<=l;++i) fin[i]=fin[i-1]*inv[i]%mod;
}

inline void rmain(){
	n=win(),m=win(),v=win(),rn=n+v-1,rm=m+v-1,px=win(),py=win(),pv=win(),px=px+pv-1,py=py+pv-1;
	if(v==1) return puts("1"),void();
	for(re int i=1;i<v;++i) tid[i][i+m]=i;
	for(re int i=1;i<v;++i) sol(i+n,i,i);
//	for(re int i=1;i<v;++i) for(re int j=1;j<v;++j) debug("%d %d:%d %d\n",i,j,sa[i][j].q,sa[i][j].p);
	n=v-1,init(v),res[0]=1;ll tmp=0;
	for(re int i=1;i<=v;++i) vl[i]=det(i);
//	for(re int i=1;i<=v;++i) debug("%d:%lld\n",i,vl[i]);
	for(re int i=1;i<=v;++i) for(re int j=i-1;j>=0;--j)
		res[j+1]=(res[j+1]+res[j])%mod,res[j]=res[j]*(mod-i)%mod;
	for(re int i=1;i<=v;++i){
		tmp=vl[i]*fin[i-1]%mod*fin[v-i]%mod;
		if((n+1-i)&1) tmp=mod-tmp;
		for(re int j=0;j<=n;++j)
			res[j]=res[j]*(mod-inv[i])%mod,res[j+1]=(res[j+1]+mod-res[j])%mod;
		for(re int j=0;j<=n;++j) ans[j]=(ans[j]+res[j]*tmp)%mod;
		for(re int j=n;j>=0;--j)
			res[j+1]=(res[j+1]+res[j])%mod,res[j]=res[j]*(mod-i)%mod;
	}
	printf("%lld\n",ans[pv-1]);
}

signed main(){
//	int T=win();while(T--)
	rmain();
	return 0;
}