#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rof(i,a,b) for(int i=(a);i>=(b);--i)
using namespace std;
const int Maxn=350,Mod=998244353;

inline int Pow(int x,int y)
{
    int res=1;
    while(y)
    {
        if(y&1) res=1ll*res*x%Mod;
        x=1ll*x*x%Mod,y>>=1;
    }
    return res;
}

int n,m,K,X,Y,Z,f[Maxn+5][Maxn+5][2],val[Maxn+5];
int d[Maxn+5][Maxn+5],h[Maxn+5][Maxn+5],dx[Maxn+5][Maxn+5][2];
int fac[Maxn+5],inv[Maxn+5],g[Maxn+5],ans;

inline int sgn(int x) {return (x&1)?Mod-1:1;}
inline int Gauss()
{
    int ans=1; For(i,1,K)
    {
        int p=i; For(p,i,K) if(h[p][i]) {p=i; break;}
        if(!h[p][i]) return 0; if(p!=i) ans=Mod-ans,swap(h[p],h[i]);
        ans=1ll*ans*h[i][i]%Mod,p=Pow(h[i][i],Mod-2);
        For(j,i,K) h[i][j]=1ll*p*h[i][j]%Mod; For(j,i+1,K)
            {p=Mod-h[j][i]; For(k,i,K) h[j][k]=(h[j][k]+1ll*p*h[i][k])%Mod;}
    } return ans;
}
inline void Solve(int sx,int sy,int id)
{
    memset(f,0,sizeof(f)); f[sx][sy][0]=1;
    For(i,sx,Maxn) Rof(j,sy,0)
    {
        if(d[i][j]==-1) f[i][j][0]=f[i][j][1]=0;
        if(d[i][j]==1) (f[i][j][1]+=f[i][j][0])%=Mod,f[i][j][0]=0;
        For(op,0,1)
        {
            if(i<Maxn) (f[i+1][j][op]+=f[i][j][op])%=Mod;
            if(j) (f[i][j-1][op]+=f[i][j][op])%=Mod;
        }
    }
    For(i,1,K)
    {
        int tx=n+i-1,ty=i-1;
        For(op,0,1) dx[i][id][op]=f[tx][ty][op];
    }
}
inline int Work(int w)
{
    For(i,1,K) For(j,1,K) h[i][j]=(dx[i][j][0]+1ll*w*dx[i][j][1])%Mod;
    return Gauss();
}

signed main()
{
    // freopen("1.in","r",stdin);

    cin>>n>>m>>K>>X>>Y>>Z; fac[0]=inv[0]=1;
    if(K==1) {cout<<1<<endl; return 0;} K--;
    For(i,1,Maxn) fac[i]=1ll*fac[i-1]*i%Mod;
    inv[Maxn]=Pow(fac[Maxn],Mod-2)%Mod;
    Rof(i,Maxn-1,1) inv[i]=1ll*inv[i+1]*(i+1)%Mod;
    for(int i=Z-1;X+i<=Maxn && Y+i<=Maxn;++i) d[X+i][Y+i]=1;
    if(Z>1) d[X+Z-2][Y+Z-2]=-1;
    For(i,1,K) Solve(i-1,m+i-1,i);
    For(i,0,K) val[i]=1ll*Work(i)*inv[i]%Mod*inv[K-i]%Mod*sgn(K-i)%Mod;
    g[1]=1; For(i,1,K) Rof(j,i+1,1) g[j]=(1ll*g[j]*(Mod-i)+g[j-1])%Mod;
    ans=1ll*val[0]*g[K-Z+2]%Mod;
    For(i,1,K)
    {
        For(j,1,K+1) g[j]=1ll*(g[j]-g[j-1]+Mod)*Pow(Mod-i,Mod-2)%Mod;
        ans=(ans+1ll*val[i]*g[K-Z+1])%Mod;
        Rof(j,K+1,1) g[j]=(1ll*g[j]*(Mod-i)+g[j-1])%Mod;
    } cout<<ans<<endl;
    // cerr<<1.0*clock()/CLOCKS_PER_SEC<<endl;
    return 0;
}