// what is matter? never mind. 
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,sse4,popcnt,abm,mmx,avx,avx2") 
#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(int i=(a);i>=(b);--i)
#define ll long long
#define ull unsigned long long
//#define int long long
using namespace std;
inline int read()
{
	char c=getchar();int x=0;bool f=0;
	for(;!isdigit(c);c=getchar())f^=!(c^45);
	for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
	if(f)x=-x;return x;
}

#define mod 998244353
struct modint{
	int x;
	modint(int o=0){x=o;}
	modint &operator = (int o){return x=o,*this;}
	modint &operator +=(modint o){return x=x+o.x>=mod?x+o.x-mod:x+o.x,*this;}
	modint &operator -=(modint o){return x=x-o.x<0?x-o.x+mod:x-o.x,*this;}
	modint &operator *=(modint o){return x=1ll*x*o.x%mod,*this;}
	modint &operator ^=(int b){
		modint a=*this,c=1;
		for(;b;b>>=1,a*=a)if(b&1)c*=a;
		return x=c.x,*this;
	}
	modint &operator /=(modint o){return *this *=o^=mod-2;}
	friend modint operator +(modint a,modint b){return a+=b;}
	friend modint operator -(modint a,modint b){return a-=b;}
	friend modint operator *(modint a,modint b){return a*=b;}
	friend modint operator /(modint a,modint b){return a/=b;}
	friend modint operator ^(modint a,int b){return a^=b;}
	friend bool operator ==(modint a,int b){return a.x==b;}
	friend bool operator !=(modint a,int b){return a.x!=b;}
	bool operator ! () {return !x;}
	modint operator - () {return x?mod-x:0;}
	bool operator <(const modint&b)const{return x<b.x;}
};
inline modint qpow(modint x,int y){return x^y;}

vector<modint> fac,ifac,iv;
inline void initC(int n)
{
	if(iv.empty())fac=ifac=iv=vector<modint>(2,1);
	int m=iv.size(); ++n;
	if(m>=n)return;
	iv.resize(n),fac.resize(n),ifac.resize(n);
	For(i,m,n-1){
		iv[i]=iv[mod%i]*(mod-mod/i);
		fac[i]=fac[i-1]*i,ifac[i]=ifac[i-1]*iv[i];
	}
}
inline modint C(int n,int m){
	if(m<0||n<m)return 0;
	return initC(n),fac[n]*ifac[m]*ifac[n-m];
}
inline modint sign(int n){return (n&1)?(mod-1):(1);}

#define fi first
#define se second
#define pb push_back
#define mkp make_pair
typedef pair<int,int>pii;
typedef vector<int>vi;

#define maxn 2000005
#define inf 0x3f3f3f3f

int n,m,k;
vi A,B;

modint f[maxn];
vector<map<vi,modint>>mpa,mpb;
void sol(vi A,vector<map<vi,modint>>&mp){
//	puts("sol");
	int sum=(accumulate(A.begin(),A.end(),0));
	mp.resize(min(sum+1,k+1));
	int n=A.size();
	mp[0][A]=1;
	For(i,0,min(k,sum)-1){
		for(auto it:mp[i]){
			vi o=it.fi;
			modint w=it.se;
			For(j,0,n-2)
				if(o[j]>o[j+1]) --o[j],mp[i+1][o]+=w,++o[j];
		}
	}
}

modint coef[maxn];

signed main()
{
	n=read();
	For(i,1,n)A.pb(read());
	m=read();
	For(i,1,m)B.pb(read());
	int L=max(n,m)+1;
	A.resize(L),B.resize(L);
	k=read();
	int sa=(accumulate(A.begin(),A.end(),0));
	int sb=(accumulate(B.begin(),B.end(),0));
	int QWQ=sa+sb+k;
	if(QWQ%2)puts("0"),exit(0);
	sol(A,mpa);
	sol(B,mpb);
	f[0]=1;
	For(i,1,k)f[i]=f[i-1]*(i*2-1);
	coef[0]=1;
	For(i,1,k)coef[i]=coef[i-1]*(k-i+1)/i;
	modint res=0;
	For(i,0,min(sa,sb)){
		if(k<sa-i+sb-i) continue;
		modint now=0;
		for(auto it:mpa[sa-i])
			if(mpb[sb-i].count(it.fi)) now+=(it.se)*mpb[sb-i][it.fi];
		int tmp=(k-(sa-i)-(sb-i));
		now*=f[tmp/2]*coef[tmp]*C(sa-i+sb-i,sb-i);
		res+=now;
	}
	cout<<res.x;
	return 0;
}
/*
0010101010
0001101010
00  101010
*/