#include<iostream>
#include<cstdio>
#include<cmath>
#include<algorithm>
#define N 120000
#define M 20000000
#define K 480000
#define g 3
#define mod 998244353
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;
}
void Adder(int &x,int d)
{
    x+=d;
    if (x>=mod) x-=mod;
    return;
}
void Adder2(int &x,int d)
{
    x+=d;
    if (x<0) x+=mod;
    return;
}
int MD(int x)
{
    return x>=mod?x-mod:x;
}
int MD2(int x)
{
    return x<0?x+mod:x;
}
int fast_pow(int a,int b)
{
    int res=1,mul=a;
    while (b)
    {
	if (b&1) res=1ll*res*mul%mod;
	mul=1ll*mul*mul%mod,b>>=1;
    }
    return res;
}
int d,n,m,k,a,b,c,s1,s2,res,ans,rev[K+1],fac[N+1],invfac[N+1],A[K+1],B[K+1],C[K+1],dp[N+1],DP[N+1],delta[N+1];
int F(int x)
{
    return (x>0)?x>>1:-((-x+1)>>1);
}
int Cs(int x,int y)
{
    if (x<y) return 0;
    return 1ll*fac[x]*invfac[y]%mod*invfac[x-y]%mod;
}
int G(int x,int y)
{
    if (y<0) y=-y;
    if ((x+y)&1) return 0;
    return Cs(x,(x+y)>>1);
}
void calc(int x,int r,int ds)
{
    delta[0]=(1<=r&&r<=x);
    for (int i=1;i<=d;++i)
    {
	delta[i]=2ll*delta[i-1]%mod;
	Adder(delta[i],G(i-1,-r)),Adder(delta[i],G(i-1,r-(x+1)));
	Adder2(delta[i],-G(i-1,1-r)),Adder2(delta[i],-G(i-1,r-x));
    }
    for (int i=0;i<=d;++i)
    {
	if (ds==1) Adder(dp[i],delta[i]);
	else Adder2(dp[i],-delta[i]);
    }
    return;
}
void solve(int x,int r)
{
    int ds=1,sr=r,op=0;
    calc(x,r,1);
    while (1)
    {
	if (!op) r=-r;
	else r=((x+1)<<1)-r;
	if (r<1-d||r>x+d) break;
	op^=1,ds=-ds,calc(x,r,ds);
    }
    ds=op=1,r=sr;
    while (1)
    {
	if (!op) r=-r;
	else r=((x+1)<<1)-r;
	if (r<1-d||r>x+d) break;
	op^=1,ds=-ds,calc(x,r,ds);
    }
    return;
}
void NTT(int limit,int *s,int type)
{
    int d,s1,s2;
    for (int i=1;i<limit;++i) rev[i]=(rev[i>>1]>>1)|((i&1)?(limit>>1):0);
    for (int i=0;i<limit;++i)
	if (rev[i]>i)
	    swap(s[i],s[rev[i]]);
    for (int i=2,w;i<=limit;i<<=1)
    {
	if (type==1) w=fast_pow(g,(mod-1)/i);
	else w=fast_pow(g,(mod-1)/i*(i-1));
	for (int j=0;j+i-1<=limit;j+=i)
	    for (int k=j,wn=1;k<j+(i>>1);++k,wn=1ll*wn*w%mod)
		s1=s[k],s2=1ll*s[k+(i>>1)]*wn%mod,s[k]=MD(s1+s2),s[k+(i>>1)]=MD2(s1-s2);
    }
    if (type==-1)
    {
	d=fast_pow(limit,mod-2);
	for (int i=0;i<limit;++i) s[i]=1ll*s[i]*d%mod;
    }
    return;
}
int main()
{
    int limit=1;
    fac[0]=1;
    for (int i=1;i<=N;++i) fac[i]=1ll*fac[i-1]*i%mod;
    invfac[N]=fast_pow(fac[N],mod-2);
    for (int i=N-1;i>=0;--i) invfac[i]=1ll*invfac[i+1]*(i+1)%mod;
    d=read(),n=read(),m=read(),k=read(),a=read(),b=read(),c=read();
    if (1ll*n*n<=10*d)
    {
	for (int i=1;i<=n;++i) dp[i]=1;
	A[0]=1;
	for (int i=1;i<=d;++i)
	{
	    for (int j=1;j<=n;++j) DP[j]=0;
	    for (int j=1;j<=n;++j)
	    {
		if (j-1>=1) Adder(DP[j-1],dp[j]);
		if (j+1<=n) Adder(DP[j+1],dp[j]);
	    }
	    for (int j=1;j<=n;++j) dp[j]=DP[j];
	    Adder(A[i],dp[a]);
	}
    }
    else
    {
	for (int i=0;i<=d;++i) dp[i]=0;
	solve(n,a);
	for (int i=0;i<=d;++i) A[i]=dp[i];
    }
    if (1ll*m*m<=10*d)
    {
	for (int i=1;i<=m;++i) dp[i]=1;
	B[0]=1;
	for (int i=1;i<=d;++i)
	{
	    for (int j=1;j<=m;++j) DP[j]=0;
	    for (int j=1;j<=m;++j)
	    {
		if (j-1>=1) Adder(DP[j-1],dp[j]);
		if (j+1<=m) Adder(DP[j+1],dp[j]);
	    }
	    for (int j=1;j<=m;++j) dp[j]=DP[j];
	    Adder(B[i],dp[b]);
	}
    }
    else
    {
	for (int i=0;i<=d;++i) dp[i]=0;
	solve(m,b);
	for (int i=0;i<=d;++i) B[i]=dp[i];
    }
    if (1ll*k*k<=3*d)
    {
	for (int i=1;i<=k;++i) dp[i]=1;
	C[0]=1;
	for (int i=1;i<=d;++i)
	{
	    for (int j=1;j<=k;++j) DP[j]=0;
	    for (int j=1;j<=k;++j)
	    {
		if (j-1>=1) Adder(DP[j-1],dp[j]);
		if (j+1<=k) Adder(DP[j+1],dp[j]);
	    }
	    for (int j=1;j<=k;++j) dp[j]=DP[j];
	    Adder(C[i],dp[c]);
	}
    }
    else
    {
	for (int i=0;i<=d;++i) dp[i]=0;
	solve(k,c);
	for (int i=0;i<=d;++i) C[i]=dp[i];
    }
    for (int i=0;i<=d;++i) A[i]=1ll*A[i]*invfac[i]%mod,B[i]=1ll*B[i]*invfac[i]%mod;
    while (limit<=(d<<1)) limit<<=1;
    NTT(limit,A,1),NTT(limit,B,1);
    for (int i=0;i<=limit;++i) A[i]=1ll*A[i]*B[i]%mod;
    NTT(limit,A,-1);
    for (int i=0;i<=d;++i) Adder(ans,1ll*A[i]*C[d-i]%mod*invfac[d-i]%mod*fac[d]%mod);
    printf("%d\n",ans);
    return 0;
}