#include<iostream>
#include<cstdio>
#include<queue>
#include<map>
#define N 1000000
#define M 60
#define mod 998244353
using namespace std;
int read()
{
	char c=0;
	int sum=0;
	while (c<'0'||c>'9') c=getchar();
	while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
	return sum;
}
int fast_pow(int a,int b)
{
	int res=1,mul=a;
	while (b)
	{
		if (b&1) res=1ll*res*mul%mod;
		mul=1ll*mul*mul%mod,b>>=1;
	}
	return res;
}
void Adder(int &x,int d)
{
	x+=d;
	if (x>=mod) x-=mod;
	return;
}
struct reads
{
	int d[M+1];
	bool operator < (const reads &t)const
	{
		for (int i=1;i<=60;++i)
			if (d[i]!=t.d[i])
				return d[i]<t.d[i];
		return 0;
	}
};
reads x,y;
int n,m,k,inv2=(mod+1)>>1,ans,res,res2,invpw2[N+1],fac[N+1],invfac[N+1];
map<reads,int>dp;
map<reads,int>dp2;
int C(int x,int y)
{
	if (x<y) return 0;
	return 1ll*fac[x]*invfac[y]%mod*invfac[x-y]%mod;
}
int get(int x)
{
	int a=res-x,b=res2-x;
	if (a+b>k||((k-a-b)&1)) return 0;
	return 1ll*C(a+b,a)*fac[k]%mod*invfac[(k-a-b)>>1]%mod*invfac[a+b]%mod*invpw2[(k-a-b)>>1]%mod;
}
void bfs()
{
	reads top,st;
	queue<reads>q;
	q.push(x),dp[x]=1;
	while (!q.empty())
	{
		top=q.front(),q.pop();
		for (int i=1;i<=60;++i)
			if (top.d[i]&&(i==60||top.d[i]-1>=top.d[i+1]))
			{
				st=top,st.d[i]--;
				if (dp.find(st)==dp.end()) dp.insert(make_pair(st,dp[top])),q.push(st);
				else Adder(dp[st],dp[top]);
			}
	}
	return;
}
void bfs2()
{
	reads top,st;
	queue<reads>q;
	q.push(y),dp2[y]=1;
	while (!q.empty())
	{
		top=q.front(),q.pop();
		for (int i=1;i<=60;++i)
			if (top.d[i]&&(i==60||top.d[i]-1>=top.d[i+1]))
			{
				st=top,st.d[i]--;
				if (dp2.find(st)==dp2.end()) dp2.insert(make_pair(st,dp2[top])),q.push(st);
				else Adder(dp2[st],dp2[top]);
			}
	}
	return;
}
int main()
{
	int rst;
	invpw2[0]=1;
	for (int i=1;i<=N;++i) invpw2[i]=1ll*invpw2[i-1]*inv2%mod;
	fac[0]=1;
	for (int i=1;i<=N;++i) fac[i]=1ll*fac[i-1]*i%mod;
	invfac[N]=fast_pow(fac[N],mod-2);
	for (int i=N-1;i>=0;--i) invfac[i]=1ll*invfac[i+1]*(i+1)%mod;
	n=read();
	for (int i=1;i<=n;++i) x.d[i]=read(),res+=x.d[i];
	m=read();
	for (int i=1;i<=m;++i) y.d[i]=read(),res2+=y.d[i];
	k=read(),bfs(),bfs2();
	for (auto it:dp)
		if (dp2.find(it.first)!=dp2.end())
		{
			rst=0;
			for (int i=1;i<=60;++i) rst+=it.first.d[i];
			Adder(ans,1ll*it.second*dp2[it.first]%mod*get(rst)%mod);
		}
	printf("%d\n",ans);
	return 0;
}