#include <cstdio>
#include <vector>
#include <algorithm>

#define rep( i, a, b ) for( int i = (a) ; i <= (b) ; i ++ )
#define per( i, a, b ) for( int i = (a) ; i >= (b) ; i -- )

const int mod = 998244353;
const int MAXN = ( 1 << 19 ) + 5;

template<typename _T>
inline void Read( _T &x ) {
	x = 0; char s = getchar(); bool f = false;
	while( ! ( '0' <= s && s <= '9' ) ) { f = s == '-', s = getchar(); }
	while( '0' <= s && s <= '9' ) { x = ( x << 3 ) + ( x << 1 ) + ( s - '0' ), s = getchar(); }
	if( f ) x = -x;
}

template<typename _T>
inline void Write( _T x ) {
	if( x < 0 ) putchar( '-' ), x = -x;
	if( 9 < x ) Write( x / 10 );
	putchar( x % 10 + '0' );
}

template<typename _T>
inline _T Abs( const _T &x ) {
	return x < 0 ? -x : x;
}

int F1[MAXN], F2[MAXN], F3[MAXN];
int fac[MAXN], ifac[MAXN];

int ways[MAXN], tmp[MAXN];

inline int Qkpow( int, int );
inline int Inv( const int &a ) { return Qkpow( a, mod - 2 ); }
inline int Mul( int x, const int &v ) { return 1ll * x * v % mod; }
inline int Sub( int x, const int &v ) { return ( x -= v ) < 0 ? x + mod : x; }
inline int Add( int x, const int &v ) { return ( x += v ) >= mod ? x - mod : x; }

inline int& MulEq( int &x, const int &v ) { return x = 1ll * x * v % mod; }
inline int& SubEq( int &x, const int &v ) { return ( x -= v ) < 0 ? ( x += mod ) : x; }
inline int& AddEq( int &x, const int &v ) { return ( x += v ) >= mod ? ( x -= mod ) : x; }

inline int C( int n, int m ) { return n < m || m < 0 ? 0 : Mul( fac[n], Mul( ifac[m], ifac[n - m] ) ); }

inline int Qkpow( int base, int indx ) {
	int ret = 1;
	while( indx ) {
		if( indx & 1 ) MulEq( ret, base );
		MulEq( base, base ), indx >>= 1;
	}
	return ret;
}

namespace Basics {
	const int L = 19, g = 3, phi = mod - 1;

	int w[MAXN];

	inline void NTTInit( const int &n = 1 << L ) {
		w[0] = 1, w[1] = Qkpow( g, phi >> L );
		rep( i, 2, n - 1 ) w[i] = Mul( w[i - 1], w[1] );
	}

	inline void DIF( int *coe, const int &n ) {
		int *wp, p, e, o;
		for( int s = n >> 1 ; s ; s >>= 1 )
			for( int i = 0 ; i < n ; i += s << 1 ) {
				p = ( 1 << L ) / ( s << 1 ), wp = w;
				for( int j = 0 ; j < s ; j ++, wp += p ) {
					e = coe[i + j], o = coe[i + j + s];
					coe[i + j] = Add( e, o );
					coe[i + j + s] = Mul( *wp, Sub( e, o ) );
				}
			}
	}

	inline void DIT( int *coe, const int &n ) {
		int *wp, p, k;
		for( int s = 1 ; s < n ; s <<= 1 )
			for( int i = 0 ; i < n ; i += s << 1 ) {
				p = ( 1 << L ) / ( s << 1 ), wp = w;
				for( int j = 0 ; j < s ; j ++, wp += p )
					k = Mul( *wp, coe[i + j + s] ),
					coe[i + j + s] = Sub( coe[i + j], k ),
					coe[i + j] = Add( coe[i + j], k );
			}
		std :: reverse( coe + 1, coe + n );
		int inv = Inv( n ); rep( i, 0, n - 1 ) MulEq( coe[i], inv );
	}
}

inline void Init( const int &n ) {
	fac[0] = 1; rep( i, 1, n ) fac[i] = Mul( fac[i - 1], i );
	ifac[n] = Inv( fac[n] ); per( i, n - 1, 0 ) ifac[i] = Mul( ifac[i + 1], i + 1 );
}

inline int Free( const int &d, const int &a, const int &b ) {
	if( Abs( b - a ) % 2 != d % 2 ) return 0;
	int x = ( d + b - a ) >> 1, y = ( d - b + a ) >> 1;
	return C( x + y, x );
}

inline int Hitless( const int &d, const int &n, const int &a, const int &b ) {
	int ret = Free( d, a, b );
	if( ! ret ) return 0;
	for( int k = 0 ; Abs( 2 * ( k + 1 ) * ( n + 1 ) - b - a ) <= d ; k ++ )
		SubEq( ret, Free( d, a, 2 * ( k + 1 ) * ( n + 1 ) - b ) );
	for( int k = 0 ; Abs( - 2 * k * ( n + 1 ) - b - a ) <= d ; k ++ )
		SubEq( ret, Free( d, a, - 2 * k * ( n + 1 ) - b ) );
	for( int k = 1 ; Abs( b - 2 * k * ( n + 1 ) - a ) <= d ; k ++ )
		AddEq( ret, Free( d, a, b - 2 * k * ( n + 1 ) ) );
	for( int k = 1 ; Abs( b + 2 * k * ( n + 1 ) - a ) <= d ; k ++ )
		AddEq( ret, Free( d, a, b + 2 * k * ( n + 1 ) ) );
	return ret;
}

inline void MonoDim( int *ret, const int &d, const int &n, const int &a ) {
	if( 1ll * n * n <= a ) {
	// if( n <= 0 ) {
		rep( i, 0, n + 1 ) ways[i] = 0;
		ways[a] = ret[0] = 1;
		rep( i, 1, d ) {
			ret[i] = 0;
			rep( j, 1, n ) tmp[j] = Add( ways[j - 1], ways[j + 1] );
			rep( j, 1, n ) AddEq( ret[i], ways[j] = tmp[j] );
		}
	} else {
		ret[0] = 1;
		rep( i, 1, d ) 
			ret[i] = Sub( Mul( ret[i - 1], 2 ), Add( Hitless( i - 1, n, a, 1 ), Hitless( i - 1, n, a, n ) ) );
	}
}

int main() {
	int D, N, M, K, A, B, C;
	Read( D ), Read( N ), Read( M ), Read( K ), Read( A ), Read( B ), Read( C );
	Init( D ), Basics :: NTTInit();
	MonoDim( F1, D, N, A );
	MonoDim( F2, D, M, B );
	MonoDim( F3, D, K, C );
	rep( i, 0, D ) {
		MulEq( F1[i], ifac[i] );
		MulEq( F2[i], ifac[i] );
		MulEq( F3[i], ifac[i] );
	}
	int L = 1; for( ; L <= 3 * D ; L <<= 1 );
	Basics :: DIF( F1, L );
	Basics :: DIF( F2, L );
	Basics :: DIF( F3, L );
	rep( i, 0, L - 1 ) F1[i] = Mul( F1[i], Mul( F2[i], F3[i] ) );
	Basics :: DIT( F1, L );
	Write( Mul( fac[D], F1[D] ) ), putchar( '\n' );
	return 0;
}