/*
¤ï¤ó¤ï¤ó¡­¡­¤ï¤ó¤À¤Û©`¤¤¤Ã¡î
Wonderhoy!
*/
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double DB;
char buf[1<<21],*p1=buf,*p2=buf;
#define getchar() (p1==p2 && (p2=(p1=buf)+fread(buf,1,1<<18,stdin),p1==p2)?EOF:*p1++)
int read()
{
	int x=0;
	char c=getchar();
	while(c<'0' || c>'9')	c=getchar();
	while(c>='0' && c<='9')	x=(x<<1)+(x<<3)+(c^'0'),c=getchar();
	return x;
}
void write(int x)
{
	if(x>9)	write(x/10);
	putchar(x%10+'0');
}
typedef pair<int,int> P;
typedef vector<int> Poly;
typedef vector<P> PolyP;
#define mp make_pair
#define spc putchar(' ')
#define etr putchar('\n')
#define len(x) (int(x.size()))
#define inlp(x,y) putchar(x==y?'\n':' ')
const int MOD=998244353,GG=3,Gi=(MOD+1)/GG;
inline int Add(int u,int v){return u+v>=MOD?u+v-MOD:u+v;}
inline int Sub(int u,int v){return u-v>=0?u-v:u-v+MOD;}
inline int Mul(int u,int v){return LL(u)*LL(v)%MOD;}
inline int add(int &u,int v){return u=Add(u,v);}
inline int sub(int &u,int v){return u=Sub(u,v);}
inline int mul(int &u,int v){return u=Mul(u,v);}
int QuickPow(int x,int p=MOD-2)
{
	int ans=1,base=x;
	while(p)
	{
		if(p&1)	mul(ans,base);
		mul(base,base);
		p>>=1;
	}
	return ans;
}
int fac[1000005],ifac[1000005];
inline int C(int n,int m){return n<m || m<0?0:Mul(fac[n],Mul(ifac[m],ifac[n-m]));}
int rev[1000005],lim;
void makeRev(){for(int i=0;i<lim;++i)	rev[i]=(rev[i>>1]>>1)|((i&1)?(lim>>1):0);}
void NTT(Poly &r,int flag)
{
	for(int i=0;i<lim;++i)	if(i<rev[i])	swap(r[i],r[rev[i]]);
	for(int o=2;o<=lim;o<<=1)
	{
		int w=QuickPow(flag==1?GG:Gi,(MOD-1)/o);
		int k=o>>1;
		for(int i=0;i<lim;i+=o)
		{
			int cn=1;
			for(int j=0;j<k;++j)
			{
				int &f=r[i+j],&g=r[i+j+k];
				int dif=Mul(g,cn);
				g=Sub(f,dif),f=Add(f,dif);
				mul(cn,w);
			}
		}
	}
	if(flag==-1)
	{
		int inv=QuickPow(lim);
		for(int i=0;i<lim;++i)	mul(r[i],inv);
	}
}
Poly operator * (Poly f,Poly g)
{
	int d=len(f)+len(g)-1;
	Poly ret;
	lim=1;
	while(lim<d)	lim<<=1;
	makeRev();
	ret.reserve(lim);
	f.resize(lim),g.resize(lim);
	NTT(f,1),NTT(g,1);
	for(int i=0;i<lim;++i)	ret.push_back(Mul(f[i],g[i]));
	NTT(ret,-1);
	ret.resize(d);
	return ret;
}
inline int Abs(int x){return x<0?-x:x;}
inline int calc(int x,int y){return ((x+y)&1)?0:C(x,(x+y)>>1);}
inline int calcf(int x,int y);
inline int calcg(int x,int y);
int k1,k2;
inline int calcf(int x,int y)
{
	if(x<Abs(k1)+Abs(y-k1))	return 0;
	return Sub(calc(x,y),calcg(x,2*k2-y));
}
inline int calcg(int x,int y)
{
	if(x<Abs(k2)+Abs(y-k2))	return 0;
	return Sub(calc(x,y),calcf(x,2*k1-y));
}
int solve(int x,int y,int K1,int K2)
{
	k1=K1,k2=K2;
	return Sub(calc(x,y),Add(calcf(x,2*k1-y),calcg(x,2*k2-y)));
}
int d;
void solve(Poly &F,int p,int c)
{
	F.reserve(d+1);
	if(c<=400)
	{
		static int f[405],g[405];
		for(int i=0;i<=c;++i)	f[i]=g[i]=0;
		F.push_back(1);
		f[p]=1;
		for(int i=1;i<=d;++i)
		{
			for(int j=0;j<=c;++j)
			{
				if(j-1>=0)	add(g[j-1],f[j]);
				if(j+1<=c)	add(g[j+1],f[j]);
			}
			int s=0;
			for(int j=0;j<=c;++j)	add(s,f[j]=g[j]),g[j]=0;
			F.push_back(s);
		}
		return ;
	}
	F.push_back(1);
	for(int i=1;i<=d;++i)
	{
		int x=solve(i-1,-p,-1-p,c+1-p),y=solve(i-1,c-p,-1-p,c+1-p);
		F.push_back(Sub(Add(F.back(),F.back()),Add(x,y)));
	}
}
int n,m,k,a,b,c;
int main(){
	fac[0]=1;
	for(int i=1;i<=1000000;++i)	fac[i]=Mul(fac[i-1],i);
	ifac[1000000]=QuickPow(fac[1000000]);
	for(int i=999999;~i;--i)	ifac[i]=Mul(ifac[i+1],i+1);
	d=read(),n=read()-1,m=read()-1,k=read()-1,a=read()-1,b=read()-1,c=read()-1;
	Poly f,g,h;
	solve(f,a,n),solve(g,b,m),solve(h,c,k);
	for(int i=0;i<=d;++i)	mul(f[i],ifac[i]),mul(g[i],ifac[i]),mul(h[i],ifac[i]);
	f=f*g*h;
	write(Mul(f[d],fac[d])),etr;
	return 0;
}