//Author: Kevin
#include<bits/stdc++.h>
//#pragma GCC optimize("O2")
using namespace std;
#define ll long long
#define ull unsigned ll
#define pb emplace_back
#define mp make_pair
#define ALL(x) (x).begin(),(x).end()
#define rALL(x) (x).rbegin(),(x).rend()
#define srt(x) sort(ALL(x))
#define rev(x) reverse(ALL(x))
#define rsrt(x) sort(rALL(x))
#define sz(x) (int)(x.size())
#define inf 0x3f3f3f3f
#define pii pair<int,int>
#define lb(v,x) (int)(lower_bound(ALL(v),x)-v.begin())
#define ub(v,x) (int)(upper_bound(ALL(v),x)-v.begin())
#define uni(v) v.resize(unique(ALL(v))-v.begin())
#define longer __int128_t
void die(string S){puts(S.c_str());exit(0);}
const ll mod=998244353;
ll ksm(ll a,ll b)
{
	ll ans=1;
	while(b)
	{
		if(b&1) ans=ans*a%mod;
		b>>=1;
		a=a*a%mod;
	}
	return ans;
}
int n,m,k,r,c,v;
ll f[105][105],g[105][105];
ll dp1[305][305],dp2[305][305];
ll val[105];
void upd(ll &a,ll b)
{
	a+=b;
	if(a>=mod)
		a-=mod;
}
ll A[105][105];
ll calc()
{
	ll ans=1;
	int n=k;
	for(int i=1;i<=n;i++)
	{
		if(!A[i][i])
			for(int j=i+1;j<=n;j++)
				if(A[j][i])
				{
					for(int k=1;k<=n;k++)
						swap(A[j][k],A[i][k]);
					ans=(mod-ans)%mod;
					break;
				}
		if(A[i][i])
		{
			ll value=ksm(A[i][i],mod-2);
			ans=ans*A[i][i]%mod;
			for(int j=1;j<=n;j++)
				A[i][j]=A[i][j]*value%mod;
			for(int j=i+1;j<=n;j++)
			{
				ll X=A[j][i];
				for(int k=1;k<=n;k++)
					A[j][k]=(A[j][k]-X*A[i][k]%mod+mod)%mod;
			}
		}
		else ans=0;
	}
	return ans;
}
ll coef[105];
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	cin>>n>>m>>k>>r>>c>>v;
	if(k==1) die("1");
	k--;
	r=k+n-r-v;
	c=c+v;
	r++;
	for(int i=1;i<=k;i++)
	{
		memset(dp1,0,sizeof(dp1));
		memset(dp2,0,sizeof(dp2));
		if(k-i<r||i>=c)
			dp1[k-i][i]=1;
		else
			dp2[k-i][i]=1;
		for(int a=k-i;a<=n+k;a++)
			for(int b=i;b<=m+k;b++) if(a!=r||b!=c-1)
			{
				if(b==c-1&&a>=r)
				{
					upd(dp2[a][b+1],dp1[a][b]);
					upd(dp2[a][b+1],dp2[a][b]);
				}
				else
				{
					upd(dp1[a][b+1],dp1[a][b]);
					upd(dp2[a][b+1],dp2[a][b]);
				}
				if(a==r-1&&b<c)
				{
					upd(dp2[a+1][b],dp1[a][b]);
					upd(dp2[a+1][b],dp2[a][b]);
				}
				else
				{
					upd(dp1[a+1][b],dp1[a][b]);
					upd(dp2[a+1][b],dp2[a][b]);
				}
			}
		for(int j=1;j<=k;j++)
		{
			f[i][j]=dp1[k-j+n][j+m];
			g[i][j]=dp2[k-j+n][j+m];
		}
	}
	for(int i=0;i<=k+3;i++)
	{
		for(int a=1;a<=k;a++)
			for(int b=1;b<=k;b++)
				A[a][b]=(f[a][b]+g[a][b]*i)%mod;
		val[i]=calc();
	}
	for(int i=0;i<=k+3;i++)
	{
		vector<ll> vec(1,1);
		ll c=val[i];
		for(int j=0;j<=k+3;j++) if(j!=i)
		{
			vector<ll> nvec(sz(vec)+1);
			for(int a=0;a<sz(vec);a++)
			{
				nvec[a+1]=(nvec[a+1]+vec[a])%mod;
				nvec[a]=(nvec[a]-vec[a]*j%mod+mod)%mod;
			}
			swap(vec,nvec);
			c=c*ksm((i-j+mod)%mod,mod-2)%mod;
		}
		for(int j=0;j<=k+2;j++)
			coef[j]=(coef[j]+c*vec[j])%mod;
	}
	cout<<coef[v-1]<<endl;
	return 0;
}