#include<bits/stdc++.h>
#define ull unsigned long long
#define ui unsigned int
#define ld long double
#define ll long long
#define lll __int128
#define fi first
#define se second
#define e emplace
#define eb emplace_back
#define db double
#define ef emplace_front
#define pii pair<int,int>
#define pll pair<ll,ll>
#define vi vector<int>
#define vll vector<ll>
#define vp vector<pii>
#define vt vector<tup>
#define all(x) x.begin(),x.end()
#define mp make_pair

#define FastI
#define FastO
//#define int ll
bool ST;
static const ll MOD=998244353,Phi=998244352,inv2=499122177,Root=3,iRoot=332748118;
static const ll inf=1073741823,Inf=4294967296,INF=4557430888798830399;
static const ld eps=1e-9,pi=3.1415926535;
char in[1<<20],*p1=in,*p2=in;
char out[1<<20],*p3=out;
using namespace std;
struct tup
{
	int x,y,z;
	tup(int X=0,int Y=0,int Z=0)
	{x=X,y=Y,z=Z;}
	inline bool operator <(const tup t)const
	{return x<t.x||(x==t.x&&y<t.y)
	||(x==t.x&&y==t.y&&z<t.z);}
};
#ifdef FastI
#define getchar() (p1==p2&&(p2=(p1=in)+fread(in,1,1<<20,stdin),p1==p2)?EOF:*p1++)
#endif
#ifdef FastO
#define putchar(x) (p3-out==1<<20?fwrite(out,1,1<<20,stdout),p3=out,0:0,*p3++=x)
#define puts(x) write(x,'\n')
#endif
namespace FastIO
{
	template<typename T> inline void write(T x,char ch=' ')
	{
		if(is_same<char,T>::value)putchar(x);
		else
		{
			if(x<0)x=-x,putchar('-');
			static char st[40];
			int top=0;
			do st[top++]=x%10+'0',x/=10;while(x);
			while(top)putchar(st[--top]);
		}
		ch!='~'?putchar(ch):0;
	}
	inline void write(const char*x,char ch=' ')
	{
		for(int i=0;x[i]!='\0';++i)putchar(x[i]);
		ch!='~'?putchar(ch):0;
	}
	inline void read(char&s){do s=getchar();while(s=='\n'||s==' ');}
	inline void read(char s[])
	{
		int len=0;char st;
		do st=getchar();while(st=='\n'||st==' ');
		s[++len]=st,st=getchar();
		while(st!='\n'&&st!=' '&&st!='\r'&&st!='\0')s[++len]=st,st=getchar();
		s[++len]='\0';
	}
	template<typename T> inline void read(T &s)
	{
		char ch=getchar();s=0;
		while((ch>'9'||ch<'0')&&ch!='-')ch=getchar();
		bool tf=(ch=='-'&&(ch=getchar()));
		while(ch>='0'&&ch<='9')s=(s<<1)+(s<<3)+ch-'0',ch=getchar();
		s=tf?-s:s;
	}
	inline void edl(){putchar('\n');}
	template<typename T1,typename T2> inline void read(pair<T1,T2> &s){read(s.fi),read(s.se);}
	template<typename T,typename...Args> inline void write(T x,Args...args){write(x,'~'),write(args...);}
	template<typename T,typename...Args> inline void read(T&x,Args&...args){read(x),read(args...);}
	#ifdef FastO
	struct Writer{~Writer(){fwrite(out,1,p3-out,stdout);}}Writ;
	#endif
}
using namespace FastIO;
namespace MTool
{
	inline int Cadd(int a,int b){return (ll)a+b>=MOD?(ll)a+b-MOD:a+b;}
	inline int Cdel(int a,int b){return a-b<0?a-b+MOD:a-b;}
	inline int Cmul(int a,int b){return 1ll*a*b%MOD;}
	inline int sqr(int a){return 1ll*a*a%MOD;}
	inline void Madd(int&a,int b){a=((ll)a+b>=MOD?(ll)a+b-MOD:a+b);}
	inline void Mdel(int&a,int b){a=(a-b<0?a-b+MOD:a-b);}
	inline void Mmul(int&a,int b){a=1ll*a*b%MOD;}
	inline int Cmod(int x){return (x%MOD+MOD)%MOD;}
	inline void Mmod(int&x){x=(x%MOD+MOD)%MOD;}
	template<typename T> inline bool Mmax(T&a,T b){return a<b?a=b,1:0;}
	template<typename T> inline bool Mmin(T&a,T b){return a>b?a=b,1:0;}
	template<typename...Args> inline void Madd(int&a,int b,Args...args){Madd(a,b),Madd(a,args...);}
	template<typename...Args> inline void Mmul(int&a,int b,Args...args){Mmul(a,b),Mmul(a,args...);}
	template<typename...Args> inline void Mdel(int&a,int b,Args...args){Mdel(a,b),Mdel(a,args...);}
	template<typename...Args> inline int Cadd(int a,int b,Args...args){return Cadd(Cadd(a,b),args...);}
	template<typename...Args> inline int Cmul(int a,int b,Args...args){return Cmul(Cmul(a,b),args...);}
	template<typename...Args> inline int Cdel(int a,int b,Args...args){return Cdel(Cdel(a,b),args...);}
	template<typename...Args,typename T> inline bool Mmax(T&a,T b,Args...args){return Mmax(a,b)|Mmax(a,args...);}
	template<typename...Args,typename T> inline bool Mmin(T&a,T b,Args...args){return Mmin(a,b)|Mmin(a,args...);}
	inline int power(int x,int y){int s=1;for(;y;y>>=1,Mmul(x,x))if(y&1)Mmul(s,x);return s;}
}
using namespace MTool;
namespace WrongAnswer_90
{
	const int N=400000;
	int fr[N+10],inv[N+10];
	inline void init(int n=N)
	{
	    fr[0]=inv[0]=1;
	    for(int i=1;i<=n;++i)fr[i]=Cmul(fr[i-1],i);
	    inv[n]=power(fr[n],MOD-2);
	    for(int i=n-1;i>0;--i)inv[i]=Cmul(inv[i+1],i+1);
	}
	
	int c,n,m,p;
	int A[200010],B[200010],C[200010],D[200010],E[200010],F[200010];
	namespace Poly
	{
	    inline vi fix(vi A,int n){return A.resize(n),A;}
	    const int MAXN=400000;
	    int Shape,VBL,Invn[MAXN],R[MAXN<<1],Prt[MAXN<<1],P0[50010],P1[50010];
	    inline void init()
	    {
	        P0[0]=P1[0]=1,VBL=ceil(sqrt(MOD)),Invn[0]=1;
	        for(int i=1;i<MAXN;++i)Invn[i]=Cmul(Invn[i-1],i);
	        int tmp=power(Invn[MAXN-1],MOD-2);
	        for(int i=MAXN-1;i>=1;--i)Invn[i]=Cmul(tmp,Invn[i-1]),Mmul(tmp,i);
	        for(int i=1;i<=VBL;++i)P0[i]=Cmul(P0[i-1],Root);
	        for(int i=1;i<=VBL;++i)P1[i]=Cmul(P1[i-1],P0[VBL]);
	    }
	    inline int powerr(int x){return Cmul(P0[x%VBL],P1[x/VBL]);}
	    inline void NTT(vi&A,int n,int opt)
	    {
	        static ull B[MAXN<<1],iv;
	        A.resize(n);
	        for(int i=0;i<n;++i)B[i]=A[R[i]];
	        for(int mid=1;mid<n;mid<<=1)
	        {
	            for(int j=0;j<n;j+=mid<<1)
	            {
	                for(int k=j;k<j+mid;++k)
	                {
	                    ull x=B[k],y=Prt[mid+k-j]*B[k+mid]%MOD;
	                    B[k]=x+y,B[k+mid]=x+MOD-y;
	                }
	            }
	        }
	        if(opt)for(int i=0;i<n;++i)A[i]=B[i]%MOD;
	        else
	        {
	            reverse(B+1,B+n),iv=power(n,MOD-2);
	            for(int i=0;i<n;++i)A[i]=Cmul(B[i]%MOD,iv);
	        }
	    }
	    inline void init(int lim)
	    {
	        if(lim==Shape)return;
	        int n=lim/2;
	        for(int i=0;i<lim;++i)R[i]=(R[i>>1]>>1)|((i&1)?n:0);
	        for(int i=1;i<lim;i<<=1)
	        {
	            int wm=powerr((MOD-1)/(i<<1));Prt[i]=1;
	            for(int j=1;j<i;++j)Prt[i+j]=Cmul(Prt[i+j-1],wm);
	        }
	        Shape=lim;
	    }
	    inline vi FFT(vi A,vi B)
	    {
	        int n=A.size(),m=B.size(),N=1;
	        while(N<=n+m)N<<=1;
	        init(N),NTT(A,N,1),NTT(B,N,1);
	        for(int i=0;i<N;++i)A[i]=Cmul(A[i],B[i]);
	        return NTT(A,N,0),A.resize(n+m-1),A;
	    }
	}
	namespace BF
	{
		int f[5010][5010];
		inline void solve()
		{
			f[0][0]=1;
			for(int i=0;i<n;++i)
			{
				for(int j=0;j<m;++j)Madd(f[i+1][j+1],Cmul(f[i][j],A[j]));
				for(int j=0;j<=m;++j)Madd(f[i+1][j],Cmul(f[i][j],Cadd(B[i],C[j])));
				for(int j=1;j<=m;++j)Madd(f[i+1][j-1],Cmul(f[i][j],D[j]));
			}
			int ans=0;
			for(int i=0;i<=n;++i)for(int j=0;j<=m;++j)
			Madd(ans,Cmul(f[i][j],E[i],F[j]));
			write(ans);
		}
	}
	namespace ac
	{
		inline void solve()
		{
			A[m]=B[n]=1;
			for(int i=1;i<=m;++i)Mmul(A[i],A[i-1]);
			for(int i=1;i<=n;++i)Mmul(B[i],B[i-1]);
			vi X(n+1),Y(m+1);
			for(int i=0;i<=n;++i)X[i]=inv[i];
			Y[0]=F[0];
			for(int i=1;i<=m;++i)Y[i]=Cmul(inv[i],A[i-1],F[i]);
			vi Z=Poly::FFT(X,Y);
			int ans=Cmul(Z[0],E[0]);
			for(int i=1;i<=n;++i)Madd(ans,Cmul(fr[i],Z[i],E[i]));
			write(ans);
		}
	}
	namespace ab
	{
		int ans=0;
		vi f[800010],g[800010];
		void dfs0(int p,int l,int r)
		{
			if(l==r)return f[p]={B[l],1},void();
			int mid=(l+r)>>1;
			dfs0(p*2,l,mid);
			dfs0(p*2+1,mid+1,r);
			f[p]=Poly::FFT(f[p*2],f[p*2+1]);
		}
		void dfs1(int p,int l,int r)
		{
			g[p].resize(r-l+1);
			if(l==r)return Madd(ans,Cmul(E[l],g[p][0]));
			int mid=(l+r)>>1;
			g[p*2]=g[p];
			int pre=g[p].back();
			reverse(all(g[p]));
			g[p]=Poly::FFT(g[p],f[p*2]);
			g[p].resize(r-l+1);
			reverse(all(g[p]));
			g[p*2+1]=g[p];
			dfs1(p*2,l,mid);
			dfs1(p*2+1,mid+1,r);
		}
		inline void solve()
		{
			Mmin(m,n);
			g[1].resize(n+1);
			g[1][0]=1;
			for(int i=0;i<m;++i)g[1][i+1]=Cmul(g[1][i],A[i]);
			for(int i=0;i<=m;++i)Mmul(g[1][i],F[i]);
			dfs0(1,0,n);
			dfs1(1,0,n);
			write(ans);
		}
	}
	void mian()
	{
		init();
		Poly::init();
		read(c,n,m,p);
		for(int i=0;i<m;++i)read(A[i]);
		for(int i=0;i<n;++i)read(B[i]);
		for(int i=0;i<=m;++i)read(C[i]);
		for(int i=1;i<=m;++i)read(D[i]);
		for(int i=0;i<=n;++i)read(E[i]);
		for(int i=0;i<=m;++i)read(F[i]);
		if(c==1)return BF::solve();
		if(c==2)return ac::solve();
		if(c==3)return ab::solve();
	}
	inline void Mian()
	{
		int T=1;
//		read(T);
		while(T--)mian();
	}
}
bool ED;
signed main()
{
//	ios::sync_with_stdio(0);
//	freopen("1.in","r",stdin);
//	freopen("1.out","w",stdout);
	double st=clock();
	WrongAnswer_90::Mian();
	double ed=clock();
 	cerr<<endl;
 	cerr<<"Time: "<<ed-st<<" ms\n";
 	cerr<<"Memory: "<<abs(&ST-&ED)/1024.0/1024.0<<" MB\n";
	return 0;
}