#include<iostream>
#include<cstdio>
#include<vector>
#include<algorithm>
#define N 200002
#define M 524288
#define K 19
#define g 3
#define mod1 167772161
#define mod2 469762049
#define mod3 998244353
#define delta1 29562547
#define delta2 115990628
#define delta3 575867115
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;
}
const __int128 sl=(__int128)(mod1)*mod2*mod3;
int c,n,m,mod,ans,A[N+1],B[N+1],C[N+1],D[N+1],E[N+1],F[N+1],wA[M+1],wB[M+1],dA[2][2][M+1],dB[2][2][M+1],dC[2][2][M+1],dp[N+1],num[M+1],length,rev[M+1];
unsigned long long invmod;
int fast_pow(int a,int b,int p)
{
	int res=1,mul=a;
	while (b)
	{
		if (b&1) res=1ll*res*mul%p;
		mul=1ll*mul*mul%p,b>>=1;
	}
	return res;
}
int MD(int x)
{
	return x>=mod?x-mod:x;
}
int MD2(int x)
{
	return x<0?x+mod:x;
}
void Adder(int &x,int d)
{
	x=x+d>=mod?x+d-mod:x+d;
	return;
}
void Adder2(int &x,int d)
{
	x=x+d<0?x+d+mod:x+d;
	return;
}
int MDS1(int x)
{
	return x>=mod1?x-mod1:x;
}
int MDS2(int x)
{
	return x>=mod2?x-mod2:x;
}
int MDS3(int x)
{
	return x>=mod3?x-mod3:x;
}
int MDS4(int x)
{
	return x<0?x+mod1:x;
}
int MDS5(int x)
{
	return x<0?x+mod2:x;
}
int MDS6(int x)
{
	return x<0?x+mod3:x;
}
int mul(int a,int b)
{
	long long c=1ll*a*b;
    c-=(((__int128)(c)*invmod)>>63)*mod;
	return c>=mod?c-mod:c;
}
struct reads
{
	int d1,d2,d3;
};
reads zero,tA[M+1],tB[M+1],wn[M+1],wn2[M+1],W[M+1],sinv[M+1],qA[2][2][M+1],qB[2][2][M+1],qC[2][2][M+1];
reads operator + (reads a,reads b)
{
	return (reads){MDS1(a.d1+b.d1),MDS2(a.d2+b.d2),MDS3(a.d3+b.d3)};
}
reads operator - (reads a,reads b)
{
	return (reads){MDS4(a.d1-b.d1),MDS5(a.d2-b.d2),MDS6(a.d3-b.d3)};
}
reads operator * (reads a,reads b)
{
	return (reads){1ll*a.d1*b.d1%mod1,1ll*a.d2*b.d2%mod2,1ll*a.d3*b.d3%mod3};
}
int calc(reads x)
{
	return (((__int128)(1ll*x.d1*delta1%mod1)*mod2*mod3+(__int128)(1ll*x.d2*delta2%mod2)*mod1*mod3+(__int128)(1ll*x.d3*delta3%mod3)*mod1*mod2)%sl)%mod;
}
unsigned long long sdelta[M+1];
struct reads2
{
	unsigned long long d1,d2,d3;
};
reads2 tdelta[M+1];
reads2 operator * (reads2 a,reads b)
{
	return (reads2){a.d1*b.d1,a.d2*b.d2,a.d3*b.d3};
}
reads2 operator + (reads2 a,reads2 b)
{
	return (reads2){a.d1+b.d1,a.d2+b.d2,a.d3+b.d3};
}
reads2 get_mod(reads2 a)
{
	return (reads2){a.d1%mod1,a.d2%mod2,a.d3%mod3};
}
void NTT(int limit,int *s,int type)
{
	int d;
	for (int i=1;i<limit;++i) rev[i]=(rev[i>>1]>>1)|((i&1)?limit>>1:0);
	for (int i=0;i<limit;++i) sdelta[rev[i]]=s[i];
	if (type==1)
	{
		for (int i=2;i<=limit;i<<=1)
		{
			d=num[M/i];
			for (int j=0;j<(i>>1);++j) W[j]=wn[j<<d];
			for (int j=0;j+i-1<limit;j+=i)
				for (int k=j;k<(j|(i>>1));++k)
					d=sdelta[k|(i>>1)]*W[k-j].d3%mod3,sdelta[k|(i>>1)]=sdelta[k]+mod3-d,sdelta[k]+=d;
			if (i>=(1<<17)||i==limit)
			{
				for (int j=0;j<=limit;++j) sdelta[j]%=mod3;
			}
		}
		for (int i=0;i<=limit;++i) s[i]=sdelta[i];
	}
	else
	{
		for (int i=2;i<=limit;i<<=1)
		{
			d=num[M/i];
			for (int j=0;j<(i>>1);++j) W[j]=wn2[j<<d];
			for (int j=0;j+i-1<limit;j+=i)
				for (int k=j;k<(j|(i>>1));++k)
					d=sdelta[k|(i>>1)]*W[k-j].d3%mod3,sdelta[k|(i>>1)]=sdelta[k]+mod3-d,sdelta[k]+=d;
			if (i>=(1<<17)||i==limit)
			{
				for (int j=0;j<=limit;++j) sdelta[j]%=mod3;
			}
		}
		for (int i=0;i<=limit;++i) s[i]=sdelta[i]*sinv[limit].d3%mod3;
	}
	return;
}
void NTT_3m(int limit,reads *s,int type)
{
	reads2 sw;
	for (int i=1;i<limit;++i) rev[i]=(rev[i>>1]>>1)|((i&1)?limit>>1:0);
	for (int i=0;i<limit;++i) tdelta[rev[i]]=(reads2){s[i].d1,s[i].d2,s[i].d3};
	if (type==1)
	{
		for (int i=2,d;i<=limit;i<<=1)
		{
			d=num[M/i];
			for (int j=0;j<(i>>1);++j) W[j]=wn[j<<d];
			for (int j=0;j+i-1<limit;j+=i)
				for (int k=j;k<(j|(i>>1));++k)
					sw=get_mod(tdelta[k|(i>>1)]*W[k-j]),tdelta[k|(i>>1)]=tdelta[k]+(reads2){mod1-sw.d1,mod2-sw.d2,mod3-sw.d3},tdelta[k]=tdelta[k]+sw;
			if (i>=(1<<17)||i==limit)
			{
				for (int j=0;j<=limit;++j) tdelta[j]=get_mod(tdelta[j]);
			}
		}
		for (int i=0;i<limit;++i) s[i]=(reads){tdelta[i].d1,tdelta[i].d2,tdelta[i].d3};
	}
	else
	{
		for (int i=2,d;i<=limit;i<<=1)
		{
			d=num[M/i];
			for (int j=0;j<(i>>1);++j) W[j]=wn2[j<<d];
			for (int j=0;j+i-1<limit;j+=i)
				for (int k=j;k<(j|(i>>1));++k)
					sw=get_mod(tdelta[k|(i>>1)]*W[k-j]),tdelta[k|(i>>1)]=tdelta[k]+(reads2){mod1-sw.d1,mod2-sw.d2,mod3-sw.d3},tdelta[k]=tdelta[k]+sw;
			if (i>=(1<<17)||i==limit)
			{
				for (int j=0;j<=limit;++j) tdelta[j]=get_mod(tdelta[j]);
			}
		}
		for (int i=0;i<=limit;++i) tdelta[i]=get_mod(tdelta[i]*sinv[limit]),s[i]=(reads){tdelta[i].d1,tdelta[i].d2,tdelta[i].d3};
	}
	return;
}
vector<int>operator + (vector<int>a,vector<int>b)
{
	if (a.empty()) return b;
	if (b.empty()) return a;
	if (a.size()<b.size()) swap(a,b);
	for (int i=0;i<b.size();++i) Adder(a[i],b[i]);
	return a;
}
vector<int>operator * (vector<int>a,vector<int>b)
{
	if (a.empty()) return a;
	if (b.empty()) return b;
	vector<int>c(a.size()+b.size()-1);
	if (min(a.size(),b.size())<=50)
	{
		for (int i=0;i<a.size();++i)
			for (int j=0;j<b.size();++j)
				Adder(c[i+j],mul(a[i],b[j]));
		return c;
	}
	if (mod==998244353)
	{
		int limit=1;
		while (limit<=a.size()+b.size()) limit<<=1;
		for (int i=0;i<=limit;++i) wA[i]=wB[i]=0;
		for (int i=0;i<a.size();++i) wA[i]=a[i];
		for (int i=0;i<b.size();++i) wB[i]=b[i];
		NTT(limit,wA,1),NTT(limit,wB,1);
		for (int i=0;i<=limit;++i) wA[i]=1ll*wA[i]*wB[i]%mod3;
		NTT(limit,wA,-1);
		for (int i=0;i<c.size();++i) c[i]=wA[i];
		return c;
	}
	else
	{
		int limit=1;
		while (limit<=a.size()+b.size()) limit<<=1;
		for (int i=0;i<=limit;++i) tA[i]=tB[i]=zero;
		for (int i=0;i<a.size();++i) tA[i]=(reads){a[i]%mod1,a[i]%mod2,a[i]%mod3};
		for (int i=0;i<b.size();++i) tB[i]=(reads){b[i]%mod1,b[i]%mod2,b[i]%mod3};
		NTT_3m(limit,tA,1),NTT_3m(limit,tB,1);
		for (int i=0;i<=limit;++i) tA[i]=tA[i]*tB[i];
		NTT_3m(limit,tA,-1);
		for (int i=0;i<c.size();++i) c[i]=calc(tA[i]);
		return c;
	}
}
vector<int>operator / (vector<int>a,vector<int>b)
{
	vector<int>c(a.size()-b.size()+1);
	if (min(b.size(),c.size())<=50)
	{
		for (int i=0;i<c.size();++i)
			for (int j=0;j<b.size();++j)
				Adder(c[i],mul(b[j],a[i+j]));
		return c;
	}
	if (mod==998244353)
	{
		int limit=1;
		while (limit<=a.size()) limit<<=1;
		for (int i=0;i<=limit;++i) wA[i]=wB[i]=0;
		for (int i=0;i<a.size();++i) wA[i]=a[i];
		for (int i=0;i<b.size();++i) wB[b.size()-i]=b[i];
		NTT(limit,wA,1),NTT(limit,wB,1);
		for (int i=0;i<=limit;++i) wA[i]=1ll*wA[i]*wB[i]%mod3;
		NTT(limit,wA,-1);
		for (int i=0;i<c.size();++i) c[i]=wA[b.size()+i];
	}
	else
	{
		int limit=1;
		while (limit<=a.size()) limit<<=1;
		for (int i=0;i<=limit;++i) tA[i]=tB[i]=zero;
		for (int i=0;i<a.size();++i) tA[i]=(reads){a[i]%mod1,a[i]%mod2,a[i]%mod3};
		for (int i=0;i<b.size();++i) tB[b.size()-i]=(reads){b[i]%mod1,b[i]%mod2,b[i]%mod3};
		NTT_3m(limit,tA,1),NTT_3m(limit,tB,1);
		for (int i=0;i<=limit;++i) tA[i]=tA[i]*tB[i];
		NTT_3m(limit,tA,-1);
		for (int i=0;i<c.size();++i) c[i]=calc(tA[b.size()+i]);
	}
	return c;
}
vector<int>srev(int sz,vector<int>a)
{
	a.resize(sz+1),reverse(a.begin(),a.end());
	return a;
}
struct seg
{
	struct node
	{
		int l,r;
		vector<int>data;
		vector<int>dst[2][2];
		vector<int>sdata;
		vector<int>sdata2;
	};
	node tree[(N<<2)+1];
	void push_up(int k)
	{
		if (k!=1)
		{
			tree[k].data=tree[k<<1].data*tree[k<<1|1].data;
			if (tree[k].r-tree[k].l+1<=50)
			{
				for (int i=0;i<=1;++i)
					for (int j=0;j<=1;++j)
						tree[k].dst[i][j]=tree[k<<1].dst[i][0]*tree[k<<1|1].dst[0][j]+tree[k<<1].dst[i][1]*tree[k<<1|1].dst[1][j];
			}
			else
			{
				int maxn=0;
				for (int i=0;i<=1;++i)
					for (int j=0;j<=1;++j)
						tree[k].dst[i][j].resize(max(tree[k<<1].dst[i][0].size()+tree[k<<1|1].dst[0][j].size()-1,tree[k<<1].dst[i][1].size()+tree[k<<1|1].dst[1][j].size()-1)),maxn=max(maxn,(int)(tree[k].dst[i][j].size()));
				if (mod==998244353)
				{
					int limit=1;
					while (limit<=maxn) limit<<=1;
					for (int i=0;i<=1;++i)
						for (int j=0;j<=1;++j)
						{
							for (int t=0;t<=limit;++t) dA[i][j][t]=dB[i][j][t]=0;
							for (int t=0;t<tree[k<<1].dst[i][j].size();++t) dA[i][j][t]=tree[k<<1].dst[i][j][t];
							for (int t=0;t<tree[k<<1|1].dst[i][j].size();++t) dB[i][j][t]=tree[k<<1|1].dst[i][j][t];
							NTT(limit,dA[i][j],1),NTT(limit,dB[i][j],1);
						}
					for (int i=0;i<=1;++i)
						for (int j=0;j<=1;++j)
						{
							for (int k=0;k<=limit;++k) dC[i][j][k]=MD(1ll*dA[i][0][k]*dB[0][j][k]%mod+1ll*dA[i][1][k]*dB[1][j][k]%mod);
							NTT(limit,dC[i][j],-1);
						}
					for (int i=0;i<=1;++i)
						for (int j=0;j<=1;++j)
							for (int t=0;t<tree[k].dst[i][j].size();++t)
								tree[k].dst[i][j][t]=dC[i][j][t];
				}
				else
				{
					int limit=1;
					while (limit<=maxn) limit<<=1;
					for (int i=0;i<=1;++i)
						for (int j=0;j<=1;++j)
						{
							for (int t=0;t<=limit;++t) qA[i][j][t]=qB[i][j][t]=zero;
							for (int t=0;t<tree[k<<1].dst[i][j].size();++t) qA[i][j][t]=(reads){tree[k<<1].dst[i][j][t]%mod1,tree[k<<1].dst[i][j][t]%mod2,tree[k<<1].dst[i][j][t]%mod3};
							for (int t=0;t<tree[k<<1|1].dst[i][j].size();++t) qB[i][j][t]=(reads){tree[k<<1|1].dst[i][j][t]%mod1,tree[k<<1|1].dst[i][j][t]%mod2,tree[k<<1|1].dst[i][j][t]%mod3};
							NTT_3m(limit,qA[i][j],1),NTT_3m(limit,qB[i][j],1);
						}
					for (int i=0;i<=1;++i)
						for (int j=0;j<=1;++j)
						{
							for (int k=0;k<=limit;++k) qC[i][j][k]=qA[i][0][k]*qB[0][j][k]+qA[i][1][k]*qB[1][j][k];
							NTT_3m(limit,qC[i][j],-1);
						}
					for (int i=0;i<=1;++i)
						for (int j=0;j<=1;++j)
							for (int t=0;t<tree[k].dst[i][j].size();++t)
								tree[k].dst[i][j][t]=calc(qC[i][j][t]);
				}
			}
		}
		return;
	}
	void build(int k,int l,int r)
	{
		tree[k].l=l,tree[k].r=r;
		if (l==r)
		{
			tree[k].data={B[l],1};
			if (l) tree[k].dst[0][1]={MD2(-1ll*A[l-1]*D[l]%mod)};
			tree[k].dst[1][0]={1},tree[k].dst[1][1]={MD2(-C[l]),1};
			return;
		}
		int mid=(l+r)>>1;
		build(k<<1,l,mid),build(k<<1|1,mid+1,r),push_up(k);
		return;
	}
	void get(int k)
	{
		if (tree[k].l==tree[k].r) return;
		int mid=(tree[k].l+tree[k].r)>>1;
		tree[k<<1].sdata=tree[k].sdata,tree[k<<1].sdata2=tree[k].sdata2;
		tree[k<<1].sdata.resize(mid-tree[k].l+1),tree[k<<1].sdata2.resize(mid-tree[k].l+1);
		tree[k<<1|1].sdata=tree[k].sdata*srev(mid-tree[k].l+1,tree[k<<1].dst[0][0])+tree[k].sdata2*srev(mid-tree[k].l+1,tree[k<<1].dst[1][0]),tree[k<<1|1].sdata2=tree[k].sdata*srev(mid-tree[k].l+1,tree[k<<1].dst[0][1])+tree[k].sdata2*srev(mid-tree[k].l+1,tree[k<<1].dst[1][1]);
		tree[k<<1|1].sdata.resize(tree[k].r-mid),tree[k<<1|1].sdata2.resize(tree[k].r-mid);
		get(k<<1),get(k<<1|1);
		return;
	}
	void solve(int k,vector<int>p,vector<int>q)
	{
		if (tree[k].l==tree[k].r)
		{
			Adder2(dp[tree[k].l],-q[0]);
			return;
		}
		int mid=(tree[k].l+tree[k].r)>>1;
		vector<int>sp=p;
		vector<int>sq=q;
		vector<int>wp;
		vector<int>wq;
		vector<int>sr(mid-tree[k].l+1);
		sp.resize(mid-tree[k].l+1),sq.resize(mid-tree[k].l+1),solve(k<<1,sp,sq);
		for (int i=tree[k].l;i<=mid;++i) sr[i-tree[k].l]=dp[i];
		wp=sr*tree[k].sdata,wq=sr*tree[k].sdata2;
		wp.resize(p.size()),wq.resize(q.size());
		for (int i=0;i<wp.size();++i) Adder(p[i],wp[i]);
		for (int i=0;i<wq.size();++i) Adder(q[i],wq[i]);
		sp=p/tree[k<<1].dst[0][0]+q/tree[k<<1].dst[1][0];
		sq=p/tree[k<<1].dst[0][1]+q/tree[k<<1].dst[1][1];
		sp.resize(tree[k].r-mid),sq.resize(tree[k].r-mid),solve(k<<1|1,sp,sq);
		return;
	}
	void solve2(int k,vector<int>p)
	{
		if (tree[k].l==tree[k].r)
		{
			Adder(ans,mul(p[0],E[tree[k].l]));
			return;
		}
		vector<int>sp=p;
		sp.resize(tree[k<<1].r-tree[k<<1].l+1),solve2(k<<1,sp),solve2(k<<1|1,p/tree[k<<1].data);
		return;
	}
};
seg T;
int main()
{
	reads w,rest;
	sinv[1]=(reads){1,1,1};
	for (int i=2;i<=M;i<<=1) num[i]=++length,sinv[i]=(reads){fast_pow(i,mod1-2,mod1),fast_pow(i,mod2-2,mod2),fast_pow(i,mod3-2,mod3)};
	w=(reads){fast_pow(g,(mod1-1)/M,mod1),fast_pow(g,(mod2-1)/M,mod2),fast_pow(g,(mod3-1)/M,mod3)},rest=(reads){1,1,1};
	for (int i=0;i<(M>>1);++i,rest=rest*w) wn[i]=rest;
	w=(reads){fast_pow(g,(mod1-1)/M*(M-1),mod1),fast_pow(g,(mod2-1)/M*(M-1),mod2),fast_pow(g,(mod3-1)/M*(M-1),mod3)},rest=(reads){1,1,1};
	for (int i=0;i<(M>>1);++i,rest=rest*w) wn2[i]=rest;
	c=read(),n=read(),m=read(),mod=read(),invmod=(1ull<<63)/mod;
	for (int i=0;i<=m-1;++i) A[i]=read();
	for (int i=0;i<=n-1;++i) B[i]=read();
	for (int i=0;i<=m;++i) C[i]=read();
	for (int i=1;i<=m;++i) D[i]=read();
	for (int i=0;i<=n;++i) E[i]=read();
	for (int i=0;i<=m;++i) F[i]=read();
	T.build(1,0,n),T.tree[1].sdata2={1},T.get(1);
	for (int i=0,res=1;i<=n;++i,res=mul(res,A[i-1])) dp[i]=mul(res,F[i]);
	vector<int>sp(n+1);
	vector<int>sq(n+1);
	T.solve(1,sp,sq);
	vector<int>p(n+1);
	for (int i=0;i<=n;++i) p[i]=dp[i];
	T.solve2(1,p),printf("%d\n",ans);
	return 0;
}