#include <bits/stdc++.h>
using namespace std;

#define mod 998244353
#define MAXN 2000005

// char buf[1<<21],*p1=buf,*p2=buf;
// #define getchar() (p1==p2 && (p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
template <typename T> inline void read (T &t){t = 0;char c = getchar();int f = 1;while (c < '0' || c > '9'){if (c == '-') f = -f;c = getchar();}while (c >= '0' && c <= '9'){t = (t << 3) + (t << 1) + c - '0';c = getchar();} t *= f;}
template <typename T,typename ... Args> inline void read (T &t,Args&... args){read (t);read (args...);}
template <typename T> inline void write (T x){if (x < 0){x = -x;putchar ('-');}if (x > 9) write (x / 10);putchar (x % 10 + '0');}
template <typename T> inline void chkmax (T &a,T b){a = max (a,b);}
template <typename T> inline void chkmin (T &a,T b){a = min (a,b);}

int D,N,M,K,X,Y,Z;

int fac[MAXN],ifac[MAXN];
int sqr (int x){return 1ll * x * x % mod;}
int mul (int a,int b){return 1ll * a * b % mod;}
int dec (int a,int b){return a >= b ? a - b : a + mod - b;}
int add (int a,int b){return a + b >= mod ? a + b - mod : a + b;}
int qkpow (int a,int b){
	int res = 1;for (;b;b >>= 1,a = mul (a,a)) if (b & 1) res = mul (res,a);
	return res;
}
void Add (int &a,int b){a = add (a,b);}
void Sub (int &a,int b){a = dec (a,b);}
int binom (int a,int b){return a >= b ? mul (fac[a],mul (ifac[b],ifac[a - b])) : 0;}

int getit (int t,int k){//走t步，位移量为k的方案数 
	if (t + k & 1) return 0;
	int s = t + k >> 1;
	if (s < 0 || s > t) return 0;
	return binom (t,s);
}

typedef vector<int> poly;

int w[MAXN],rev[MAXN];
#define SZ(A) ((int)A.size())

void init_ntt (){
	int lim = 1 << 20;
	for (int i = 0;i < lim;++ i) rev[i] = (rev[i >> 1] >> 1) | ((i & 1) << 19);
	int Wn = qkpow (3,(mod - 1) / lim);w[lim >> 1] = 1;
	for (int i = lim / 2 + 1;i < lim;++ i) w[i] = mul (w[i - 1],Wn);
	for (int i = lim / 2 - 1;i;-- i) w[i] = w[i << 1];
}

void ntt (poly &a,int type){
#define G 3
#define Gi 332748118
	static int d[MAXN];int lim = a.size();
	for (int i = 0,z = 20 - __builtin_ctz(lim);i < lim;++ i) d[rev[i] >> z] = a[i];
	for (int i = 1;i < lim;i <<= 1)
		for (int j = 0;j < lim;j += i << 1)
			for (int k = 0;k < i;++ k){
				int x = mul (w[i + k],d[i + j + k]);
				d[i + j + k] = dec (d[j + k],x),d[j + k] = add (d[j + k],x);
			}
	for (int i = 0;i < lim;++ i) a[i] = d[i] % mod;
	if (type == -1){
		reverse (a.begin() + 1,a.begin() + lim);
		for (int i = 0,Inv = qkpow (lim,mod - 2);i < lim;++ i) a[i] = mul (a[i],Inv);
	}
#undef G
#undef Gi 
}

poly operator * (poly A,poly B){
	int lim = 1,l = 0,len = SZ(A) + SZ(B) - 1;
	while (lim < SZ(A) + SZ(B)) lim <<= 1,++ l;
	A.resize (lim),B.resize (lim),ntt (A,1),ntt (B,1);
	for (int i = 0;i < lim;++ i) A[i] = mul (A[i],B[i]);
	ntt (A,-1),A.resize (len);
	return A;
}

int f0[MAXN],g0[MAXN],res[MAXN],tl[MAXN],tr[MAXN];
int countit (int t,int L,int R){
	int nowl = tl[t],nowr = tr[t],ans = res[t];
	while (nowl > L) -- nowl,Add (ans,binom (t,nowl));
	while (nowl < L) Sub (ans,binom (t,nowl)),nowl ++;
	while (nowr < R) ++ nowr,Add (ans,binom (t,nowr));
	while (nowr > R) Sub (ans,binom (t,nowr)),nowr --;
	return ans;
}

void divide (int n,int L,int R){
	if (L == R) return ;
	int mid = L + R >> 1;
	divide (n,L,mid);
	poly F,G;int len = R - L + 1;F.resize (len + 1),G.resize (mid - L + 1);
	for (int j = 0;j <= len;++ j) F[j] = add (getit (j,-1),getit (j,n));
	for (int j = 0;j <= mid - L;++ j) G[j] = g0[L + j];
	F = F * G;
	for (int j = mid + 1;j <= R;++ j) Sub (g0[j],F[j - L - 1]);
	divide (n,mid + 1,R);
}

poly work (int n,int beg){
	f0[0] = g0[0] = res[0] = 1;
	for (int i = 0;i <= D;++ i) tl[i] = (i + 1) >> 1,tr[i] = (i + n - 1) >> 1;
	for (int i = 1;i <= D;++ i) g0[i] = add (countit (i - 1,tl[i] - 1,tr[i] - 1),countit (i - 1,tl[i],tr[i])),res[i] = g0[i];
	divide (n,0,D);
	for (int i = 0;i <= D;++ i){
		tl[i] = i - beg + 1,tr[i] = i - beg + n;
		if (tl[i] & 1) tl[i] ++;if (tr[i] & 1) tr[i] --;
		tl[i] >>= 1,tr[i] >>= 1,chkmax (tl[i],0);
	}
	for (int i = 1;i <= D;++ i) f0[i] = add (countit (i - 1,tl[i] - 1,tr[i] - 1),countit (i - 1,tl[i],tr[i])),res[i] = f0[i];
	poly F,G;F.resize (D + 1),G.resize (D + 1);
	for (int j = 0;j <= D;++ j) F[j] = add (getit (j,0 - beg),getit (j,n + 1 - beg)),G[j] = g0[j];
	F = F * G;
	for (int i = 1;i <= D;++ i) Sub (f0[i],F[i - 1]);
	poly Now;Now.resize (D + 1);
	for (int i = 0;i <= D;++ i) Now[i] = mul (f0[i],ifac[i]);
	return Now;
}

signed main(){
	read (D,N,M,K,X,Y,Z),init_ntt ();
	int up = 2e6;
	fac[0] = 1;for (int i = 1;i <= up;++ i) fac[i] = mul (fac[i - 1],i);
	ifac[up] = qkpow (fac[up],mod - 2);for (int i = up;i;-- i) ifac[i - 1] = mul (ifac[i],i);
	poly F1 = work (N,X),F2 = work (M,Y),F3 = work (K,Z);
	F1 = F1 * F2 * F3,write (mul (F1[D],fac[D])),putchar ('\n');
	return 0;
}
/*
120000 300 1 1 141 1 1
*/