#include<bits/stdc++.h>
using namespace std;
#define int long long
#define md(a) a=(a%mod+mod)%mod
#define file(a) freopen(#a".in","r",stdin);freopen(#a".out","w",stdout)

bool ST;

const int N=1000005,mod=998244353;
namespace Math
{
	int fac[N],inv[N],upd,iv[N];
	inline void add(int &x,const int &y){x+=y;if(x>=mod)x-=mod;}
	inline void dec(int &x,const int &y){x-=y;if(x<0)x+=mod;}
	inline int qp(int a,int n){int b=1;while(n){if(n&1)b=b*a%mod;a=a*a%mod,n>>=1;}return b;}
	inline void PreC()
	{
		upd=N-5,fac[0]=1;for(int i=1;i<=upd;i++)fac[i]=fac[i-1]*i%mod;
		inv[upd]=qp(fac[upd],mod-2);for(int i=upd-1;i>=0;i--)inv[i]=inv[i+1]*(i+1)%mod;
		for(int i=1;i<=upd;i++)iv[i]=inv[i]*fac[i-1]%mod;
	}
	inline int C(int n,int m){if(n<m||m<0)return 0;return fac[n]*inv[m]%mod*inv[n-m]%mod;}
};
using namespace Math;
int Day,n,m,h,qx,qy,qz,X[N],Y[N],Z[N];

namespace Force
{
	int dp[N],tmp[N];int *f;int *g;
	inline void main(int p,int q,int *Val)
	{
		f=dp+n,g=tmp+n;for(int i=-p;i<=q;i++)f[i]=0;f[0]=1;Val[0]=1;
		for(int d=1;d<=Day;d++)
		{
			for(int i=-p;i<=q;i++)g[i]=f[i],f[i]=0;
			for(int i=-p;i<=q;i++){if(i-1>=-p)add(f[i-1],g[i]);if(i+1<=q)add(f[i+1],g[i]);}
			for(int i=-p;i<=q;i++)add(Val[d],f[i]);
		}
	}
};
inline void Rev(int &x,int &y,int p){x+=p,y-=p;swap(x,y);}

namespace Right
{
	int P,Q;
	inline void Push(int &val,int l,int r,int d)
	{
		val=val*2%mod;dec(val,C(d,l)),add(val,C(d,r+1));
		val=val*2%mod;dec(val,C(d+1,r+1)),add(val,C(d+1,l));
	}
	inline void Start(int x,int y,int tag,int *f)
	{
		int l,r,val;
		l=ceil((-P)/2.0)-x,r=floor(Q/2.0)-x,val=0;for(int i=0;i<=0;i++)if(l<=i&&i<=r)add(val,C(0,i));
		for(int d=0;d<=Day;d+=2)add(f[d],val*tag%mod),Push(val,l,r,d),l++,r++;
		l=ceil((1-P)/2.0)-x,r=floor((1+Q)/2.0)-x,val=0;for(int i=0;i<=1;i++)if(l<=i&&i<=r)add(val,C(1,i));
		for(int d=1;d<=Day;d+=2)add(f[d],val*tag%mod),Push(val,l,r,d),l++,r++;
	}
	inline void main(int p,int q,int *f)
	{
		P=p,Q=q,p++,q++;int x=0,y=0;Start(x,y,1,f);
		x=y=0;for(int t=1;t<=Day/n+2;t++){if(t&1)Rev(x,y,p);else Rev(x,y,-q);Start(x,y,(t&1)?mod-1:1,f);}
		x=y=0;for(int t=1;t<=Day/n+2;t++){if(t&1)Rev(x,y,-q);else Rev(x,y,p);Start(x,y,(t&1)?mod-1:1,f);}
	}
};

namespace Iratis
{
	inline void main(int p,int q,int *Val)
	{
		// Force::main(p,q,Val);return ;
		Right::main(p,q,Val);return ;
		if(n<=sqrt(Day))Force::main(p,q,Val);
		else Right::main(p,q,Val);
	}
};

namespace cul8r
{
	int lim,l,A[N],B[N],rev[N],ome[N],va[N],vb[N];
	inline void NTT(int *A,int type)
	{
		for(int i=0;i<lim;i++)if(i<rev[i])swap(A[i],A[rev[i]]);
		for(int p=1;p<=l;p++)
		{
			int m=(1<<p),wm=qp(3,(mod-1)/m);if(type==-1)wm=qp(wm,mod-2);
			ome[0]=1;for(int j=1;j<m/2;j++)ome[j]=1ll*ome[j-1]*wm%mod;
			for(int i=0;i<lim;i+=m)for(int j=0;j<m/2;j++)
			{
				int u=A[i+j],t=1ll*ome[j]*A[i+j+m/2]%mod,v=u-t;u+=t;
				if(u>=mod)u-=mod;if(v<0)v+=mod;A[i+j]=u,A[i+j+m/2]=v;
			}
		}
	}
	inline void Merge(int n,int m)
	{
		lim=1,l=0;while(lim<=n+m)lim<<=1,l++;
		for(int i=0;i<lim;i++)rev[i]=((rev[i>>1]>>1)|((i&1)<<(l-1))),A[i]=B[i]=0;
		for(int i=0;i<=n;i++)A[i]=va[i];for(int i=0;i<=m;i++)B[i]=vb[i];
		NTT(A,1),NTT(B,1);for(int i=0;i<lim;i++)A[i]=1ll*A[i]*B[i]%mod;int P=qp(lim,mod-2);
		NTT(A,-1);for(int i=0;i<lim;i++)A[i]=1ll*A[i]*P%mod;for(int i=0;i<=n+m;i++)va[i]=A[i];
	}
	inline void solve()
	{
		// for(int i=0;i<=Day;i++)cerr<<X[i]<<' ';cout<<'\n';
		// for(int i=0;i<=Day;i++)cerr<<Y[i]<<' ';cout<<'\n';
		// for(int i=0;i<=Day;i++)cerr<<Z[i]<<' ';cout<<'\n';
		for(int i=0;i<=Day;i++)va[i]=X[i]*inv[i]%mod,vb[i]=Y[i]*inv[i]%mod;Merge(Day,Day);
		for(int i=0;i<=Day;i++)vb[i]=Z[i]*inv[i]%mod;Merge(Day,Day);cout<<va[Day]*fac[Day]%mod<<'\n';
	}
};

bool ED;

signed main()
{
    int time_st=clock();
	cerr<<(&ST-&ED)/1024.0/1024<<endl;ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	cin>>Day>>n>>m>>h>>qx>>qy>>qz;PreC();
	Iratis::main(qx-1,n-qx,X),Iratis::main(qy-1,m-qy,Y),Iratis::main(qz-1,h-qz,Z);
	cul8r::solve();cerr<<(clock()-time_st)/1e6<<endl;return 0;
}