#include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,j,k) for(int i=(j);i<=(k);i++)
#define per(i,j,k) for(int i=(j);i>=(k);i--)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
typedef vector<int> vi;
typedef pair<int,int> pi;

const int N=1<<18, mod=998244353;
int md(const int &x){
	return x>=mod? x-mod: x;
}
int qpow(int x,int y){
	int res=1;
	while(y){
		if(y%2) res=res*x%mod;
		x=x*x%mod;
		y/=2;
	}
	return res;
}int inv(int x){return qpow(x,mod-2);}
int fac[N],ifac[N],P[N];
void init(){
	fac[0]=1;
	rep(i,1,N-1){
		fac[i]=fac[i-1]*i%mod;
	}
	ifac[N-1]=inv(fac[N-1]);
	per(i,N-1,1){
		ifac[i-1]=ifac[i]*i%mod;
	}
	rep(i,0,17){
		int stp=qpow(3,(mod-1)>>(i+1));
		P[1<<i]=1;
		rep(j,(1<<i)+1,(2<<i)-1){
			P[j]=P[j-1]*stp%mod;
		}
	}
}
int C(int m,int n){
	return n<0 || n>m? 0: fac[m]*ifac[n]%mod*ifac[m-n]%mod;
}
int Sum(int n,int l,int r){
	l=max(0ll, l), r=min(n, r);
	int res=0;
	rep(i,l,r){
		res+= C(n,i);
	}
	return res%mod;
}
void DIF(vi &a){
	per(i,17,0){
		int len=1<<i;
		for(int j=0;j<N;j+=len*2){
			int idx=len;
			rep(k,j,j+len-1){
				int A=a[k], B=a[k+len];
				a[k]=md(A+B), a[k+len]=(A-B+mod)*P[idx++]%mod;
			}
		}
	}
}
void DIT(vi &a){
	rep(i,0,17){
		int len=1<<i;
		for(int j=0;j<N;j+=len*2){
			int idx=len;
			rep(k,j,j+len-1){
				int A=a[k], B=a[k+len]*P[idx++]%mod;
				a[k]=md(A+B), a[k+len]=md(A-B+mod);
			}
		}
	}
	reverse(a.begin()+1,a.end());
	int iv=inv(N);
	for(int &x:a){
		(x*= iv )%=mod;
	}
}
vi mul(vi x,vi y){
	x.resize(N), y.resize(N);
	DIF(x); DIF(y);
	rep(i,0,N-1){
		(x[i]*= y[i] )%=mod;
	}
	DIT(x);
	return x;
}
vi solve(int n,int a,int d){
	if(n==1){
		vi res(d+1,0);
		res[0]=1;
		return res;
	}
	if(n<=1500){
		vi f(n,1),res(d+1,0);
		res[0]=1;
		rep(i,1,d){
			vi tmp(n);
			tmp[0]=f[1], tmp[n-1]=f[n-2];
			rep(j,1,n-2){
				tmp[j]=md(f[j-1]+f[j+1]);
			}
			swap(f,tmp);
			res[i]=f[a]*ifac[i]%mod;
		}
		return res;
	}
	else{
		vi res(d+1,0);
		auto calc=[&](int cx,int op){
			{
				int cle=cx&1, cri=(cx+n)%2? n-1: n-2;
				int dn=0, dl=(cle-cx)/2, dr=(cri-cx)/2;
				int csum=Sum(0, dl, dr);
				res[0]+=op*csum;
				for(int i=2;i<=d;i+=2){
					csum=(csum*2-C(dn,dl)+C(dn,dr+1))%mod;
					dn++, dl++, dr++;
					csum=(csum*2+C(dn,dl-1)-C(dn,dr))%mod;
					dn++;
					res[i]+=op*csum;
				}
			}
			{
				int cle=(cx+1)&1, cri=(cx+1+n)%2? n-1: n-2;
				int dn=1, dl=(cle-cx+1)/2, dr=(cri-cx+1)/2;
				int csum=Sum(1, dl, dr);
				res[1]+=op*csum;
				for(int i=3;i<=d;i+=2){
					csum=(csum*2-C(dn,dl)+C(dn,dr+1))%mod;
					dn++, dl++, dr++;
					csum=(csum*2+C(dn,dl-1)-C(dn,dr))%mod;
					dn++;
					res[i]+=op*csum;
				}
			}
		};
		calc(a,1);
		int cx=a,op=1;
		while(1){
			if(op==1){
				cx=-2-cx, op=-1;
			}
			else{
				cx=n*2-cx, op=1;
			}
			if(abs(cx)>d && abs(cx-(n-1))>d){
				break;
			}
			calc(cx,op);
		}
		cx=a, op=1;
		while(1){
			if(op==1){
				cx=n*2-cx, op=-1;
			}
			else{
				cx=-2-cx, op=1;
			}
			if(abs(cx)>d && abs(cx-(n-1))>d){
				break;
			}
			calc(cx,op);
		}
		rep(i,0,d){
			res[i]=(res[i]%mod+mod)*ifac[i]%mod;
		}
		return res;
	}
}
int d,n,m,k,a,b,c;
signed main(){
	// freopen("bacteria.in","r",stdin);
	// freopen("bacteria.out","w",stdout);
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	
	init();
	cin>>d>>n>>m>>k>>a>>b>>c;
	solve(n,a-1,d);
	vi X=solve(n,a-1,d), Y=solve(m,b-1,d), Z=solve(k,c-1,d);
	X=mul(X,Y);
	X.resize(d+1);
	X=mul(X,Z);
	X.resize(d+1);
	int ans=X[d]*fac[d]%mod;
	cout<<ans<<'\n';
}