#include<bits/stdc++.h>
using namespace std;
const int mod=998244353,N=1e6+5,B=450,p3=3,inv3=332748118;
int d,n,m,k,a,b,c,f1[N],f2[N],f3[N],g[N],fac[N],inv[N];
int power(int a,int b){int res=1;for(;b;b>>=1){if(b&1)res=1ll*res*a%mod;a=1ll*a*a%mod;}return res;}
void init()
{
	fac[0]=1;for(int i=1;i<N;i++)fac[i]=1ll*fac[i-1]*i%mod;
	inv[N-1]=power(fac[N-1],mod-2);
	for(int i=N-2;i>=0;i--)inv[i]=1ll*inv[i+1]*(i+1)%mod;
}
inline int C(int x,int y){if(x<0 || y<0 || x<y)return 0;return 1ll*fac[x]*inv[y]%mod*inv[x-y]%mod;}
inline int F(int x,int y){if(x<0 || y<0)return 0;return C(x+y,x);}
bool ck(int x,int y,int i,int a,int b){if(y==x+i*b-(i-1)*a || y==x+(i+1)*b-i*a)return 0;return 1;}
int dp[N];
void solve(int n,int lim,int *f)
{
	if(n<=B)
	{
		for(int i=1;i<=n;i++)dp[i]=1;f[0]=1;
		for(int i=1;i<=d;i++)
		{
			for(int j=1;j<=n;j++)g[j]=0;
			for(int j=1;j<=n;j++)
			{
				if(j>1)g[j-1]=(g[j-1]+dp[j])%mod;
				if(j<n)g[j+1]=(g[j+1]+dp[j])%mod;
			}
			for(int j=1;j<=n;j++)dp[j]=g[j],g[j]=0;
			f[i]=dp[lim];
		}
	}
	else
	{
		int a=lim,b=lim-1-n;
		for(int i=1;;i++)
		{
			int xl=0,yl=i*a-(i-1)*b+1,now=1,xr=xl,yr=yl,len=xl+yl;
			bool fl=0;
			int stx=0,sty=0;
			while(len<=d)
			{
				fl=1;
				if(i&1)f[len]=(f[len]-now+mod)%mod;
				else f[len]=(f[len]+now)%mod;
				now=2*now%mod;
				if(!ck(xl,yl+1,-i,a,b))now=(now-F(xl-stx,yl-sty)+mod)%mod,xl++;else now=(now+F(xl-1-stx,yl+1-sty))%mod,yl++;
				if(!ck(xr+1,yr,-i,a,b))now=(now-F(xr-stx,yr-sty)+mod)%mod,yr++;else now=(now+F(xr+1-stx,yr-1-sty))%mod,xr++;
				len++;
			}
			xl=-i*b+(i-1)*a+1,yl=0,now=1,xr=xl,yr=yl,len=xl+yl;
			stx=0,sty=0;
			while(len<=d)
			{
				fl=1;
				if(i&1)f[len]=(f[len]-now+mod)%mod;
				else f[len]=(f[len]+now)%mod;
				now=2*now%mod;
				if(!ck(xl,yl+1,i,a,b))now=(now-F(xl-stx,yl-sty)+mod)%mod,xl++;else now=(now+F(xl-1-stx,yl+1-sty))%mod,yl++;
				if(!ck(xr+1,yr,i,a,b))now=(now-F(xr-stx,yr-sty)+mod)%mod,yr++;else now=(now+F(xr+1-stx,yr-1-sty))%mod,xr++;
				len++;
			}
			if(!fl)break;
		}
		int xl=0,yl=0,now=1,xr=xl,yr=yl,len=xl+yl;
		while(len<=d)
		{
			f[len]=(f[len]+now)%mod;
			now=2*now%mod;
			if(!ck(xl,yl+1,0,a,b))now=(now-F(xl,yl)+mod)%mod,xl++;else now=(now+F(xl-1,yl+1))%mod,yl++;
			if(!ck(xr+1,yr,0,a,b))now=(now-F(xr,yr)+mod)%mod,yr++;else now=(now+F(xr+1,yr-1))%mod,xr++;
			len++;
		}
	}
}
int g1[N],g2[N];
int X[N],Y[N],r[N],lim,l,Z[N];
void ntt(int *temp,int tp)
{
	for(int i=0;i<lim;i++)if(i<r[i])swap(temp[i],temp[r[i]]);
	for(int i=1;i<lim;i<<=1)
	{
		int wn=power(tp,(mod-1)/(i<<1));
		for(int j=0;j<lim;j+=(i<<1))
		{
			int w=1;
			for(int k=0;k<i;k++,w=1ll*w*wn%mod)
			{
				int x=temp[j+k],y=1ll*w*temp[i+j+k]%mod;
				temp[j+k]=(x+y)%mod,temp[i+j+k]=(x-y+mod)%mod;
			}
		}
	}
}
void init1(int n)
{
	lim=1,l=0;
	while(lim<=n)lim<<=1,l++;
	for(int i=0;i<lim;i++)r[i]=(r[i>>1]>>1)|((i&1)<<l-1),X[i]=0,Y[i]=0;
}
int main()
{
	init();
	// freopen("bacteria.in","r",stdin);
	// freopen("bacteria.out","w",stdout);
	scanf("%d %d %d %d %d %d %d",&d,&n,&m,&k,&a,&b,&c);
	solve(n,a,f1),solve(m,b,f2),solve(k,c,f3);
	init1(d*2+2);
	for(int i=0;i<=d;i++)X[i]=1ll*f1[i]*inv[i]%mod,Y[i]=1ll*f2[i]*inv[i]%mod,Z[i]=1ll*f3[i]*inv[i]%mod;
	ntt(X,p3),ntt(Y,p3),ntt(Z,p3);
	for(int i=0;i<lim;i++)X[i]=1ll*X[i]*Y[i]%mod*Z[i]%mod;
	ntt(X,inv3);
	int invl=power(lim,mod-2);
	for(int i=0;i<lim;i++)X[i]=1ll*X[i]*invl%mod*fac[i]%mod;
	printf("%d\n",X[d]);
	return 0;
}