#include<bits/stdc++.h>
#define Gc() getchar()
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define eb emplace_back
#define all(x) x.begin(),x.end()
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;
const int N=2e5+5,M=N*120+5,K=1000+5,mod=998244353,Mod=mod-1;const db eps=1e-9;const int INF=1e9+7;mt19937 rnd(263082);
#define Tp template<typename T>
#define Ts template<typename T,typename... Ar>
namespace Debug{
	Tp void _debug(char* f,T t){cerr<<f<<'='<<t<<endl;}
	Ts void _debug(char* f,T x,Ar... y){while(*f!=',') cerr<<*f++;cerr<<'='<<x<<",";_debug(f+1,y...);}
	#ifdef LOCAL
	#define gdb(...) _debug((char*)#__VA_ARGS__,__VA_ARGS__)
	#else 
	#define gdb(...) void()
	#endif
}using namespace Debug;

using poly=vector<ll>;
ll mpow(ll x,int y=mod-2){ll ans=1;while(y) y&1&&(ans=ans*x%mod),y>>=1,x=x*x%mod;return ans;}
ll sgn(int x){return x&1?mod-1:1;}
namespace Poly{
	const int N=1<<21,g=3;
	int tr[N],k,a[N],b[N];ll pw[N];
	void init(int n){
		for(k=2;k<=n;k<<=1);
		for(int i=0;i<k;i++) tr[i]=(tr[i>>1]>>1)|(i&1?k/2:0);
		pw[k/2]=1;pw[k/2+1]=mpow(g,(mod-1)/k);
		for(int i=k/2+2;i<k;i++) pw[i]=pw[i-1]*pw[k/2+1]%mod;
		for(int i=k/2-1;i;i--) pw[i]=pw[i<<1];
	}
	void ntt(int *A,int k,int flag){
		static ull a[N];for(int i=0;i<k;i++) a[tr[i]]=A[i];
		for(int i=2;i<=k;i<<=1){
			ll *e=pw+i/2;
			for(int j=0;j<k;j+=i){
				for(int h=j;h<j+i/2;h++){
					int x=a[h+i/2]*e[h-j]%mod;
					a[h+i/2]=a[h]+mod-x;a[h]+=x;
				}
			}
			if(i==(1<<18)){
				for(int j=0;j<k;j++) a[j]%=mod;
			}
		}
		for(int i=0;i<k;i++) A[i]=a[i]%mod;
		if(flag) return;
		reverse(A+1,A+k);
		ll iv=mpow(k);for(int i=0;i<k;i++) A[i]=A[i]*iv%mod;
	}
	namespace Public{
		poly operator *(const poly &A,const poly &B){
			int n=A.size(),m=B.size(),lim=n+m-1;
			init(lim);
			copy(A.begin(),A.end(),a);fill(a+n,a+k,0);
			copy(B.begin(),B.end(),b);fill(b+m,b+k,0);
			ntt(a,k,1);ntt(b,k,1);
			for(int i=0;i<k;i++) a[i]=1ll*a[i]*b[i]%mod;
			ntt(a,k,0);
			return poly(a,a+lim);
		}
		poly& operator *=(poly &A,const poly &B){
			return A=A*B;
		}
		poly operator /(const poly &A,const poly &B){
			poly C=A,D=B;
			reverse(D.begin(),D.end());
			C*=D;
			return poly(C.begin()+int(D.size())-1,C.end());
		}
		poly& operator /=(poly &A,const poly &B){
			return A=A/B;
		}
		poly operator *(const poly &A,const int B){
			poly C=A;for(int i=0;i<C.size();i++) C[i]=1ll*C[i]*B%mod;
			return C;
		}
		poly& operator *=(poly &A,const int &B){
			return A=A*B;
		}
		poly operator +(const poly &A,const poly &B){
			poly C(max(A.size(),B.size()));
			for(int i=0;i<A.size();i++) C[i]=A[i];
			for(int i=0;i<B.size();i++) C[i]=(B[i]+C[i])%mod;
			return C;
		}
		poly& operator +=(poly &A,const poly &B){
			return A=A+B;
		}
		poly operator -(const poly &A,const poly &B){
			poly C(max(A.size(),B.size()));
			for(int i=0;i<A.size();i++) C[i]=A[i];
			for(int i=0;i<B.size();i++) C[i]=(C[i]+mod-B[i])%mod;
			return C;
		}
		poly& operator -=(poly &A,const poly &B){
			return A=A-B;
		}
		poly operator %(const poly &A,const int &B){
			poly C=A;
			if(C.size()>B) C.resize(B);
			return C;
		}
		poly& operator %=(poly &A,const int B){
			return A=A%B;
		}
		poly operator <<(const poly &A,const int &B){
			poly C(A.size()+B);
			copy(all(A),C.begin()+B);
			return C;
		}
		poly& operator <<=(poly &A,const int &B){
			return A=A<<B;
		}
		poly operator >>(const poly &A,const int &B){
			if(B>=A.size()) return poly({});
			return poly(A.begin()+B,A.end());
		}
		poly& operator >>=(poly &A,const int &B){
			return A=A>>B;
		}
		poly inve(poly A,int n=-1){
			if(n==-1) n=A.size();
			if(n==1) return poly({mpow(A[0])});
			poly A0=inve(A%(n+1>>1),n+1>>1);
			return A0*(poly({2})-A*A0%n)%n;
		}
		poly sqrt(poly A,int n=-1){
			if(n==-1) n=A.size();
			if(n==1) return poly({1});
			poly A0=sqrt(A%(n+1>>1),n+1>>1);
			return (A0*A0%n+A)*inve(A0,n)%n*(mod+1>>1);
		}
		poly der(poly A){
			poly B(A.size()-1);
			for(int i=1;i<A.size();i++) B[i-1]=1ll*A[i]*i%mod;
			return B;
		}
		poly integ(poly A){
			poly B(A.size()+1);
			static ll inv[N];inv[1]=1;for(int i=2;i<=A.size();i++) inv[i]=(mod-inv[mod%i])*(mod/i)%mod;
			for(int i=0;i<A.size();i++) B[i+1]=inv[i+1]*A[i]%mod;
			return B;
		}
		poly ln(poly A,int n=-1){
			if(n==-1) n=A.size();
			return integ(der(A)*inve(A,n)%n)%n;
		}
		poly exp(poly A,int n=-1){
			if(n==-1) n=A.size();
			if(n==1) return poly({1});
			poly A0=exp(A%(n+1>>1),n+1>>1);
			return A0*(poly({1})-ln(A0,n)+A)%n;
		}
		poly mpow(poly A,int n,ll k){gdb(n,k);
			auto p=find_if(A.begin(),A.end(),[](ll x){return x;})-A.begin();
			if(p==A.size()) return A;
			poly B(A.size()-p);for(int i=p;i<A.size();i++) B[i-p]=A[i];
			ll v=::mpow(B[0],k%Mod),iv=::mpow(B[0]);
			for(ll &i:B) i=i*iv%mod;B=ln(B,n);
			for(ll &i:B) i=k%mod*i%mod;B=exp(B,n);
			for(ll &i:B) i=i*v%mod;
			for(int i=n-1;~i;i--) B[i]=(i>=1ll*k*p?B[i-k*p]:0);
			return B;
		}
	}
}using namespace Poly::Public;


int c,n,m,p;
poly A,B,C,D,E,F;
namespace Sub1{
	const int N=2e5+5;
	ull f[N],g[N];
	void Solve(){
		f[0]=1;
		ull ans=E[0]*F[0]%mod;
		ans=E[0]*F[0];
		for(int i=0;i<n;i++){
			copy(f,f+m+1,g);
			fill(f,f+m+1,0);
			for(int j=0;j<=m;j++){
				if(j<m) (f[j+1]+=g[j]*A[j])%=mod;
				(f[j]+=g[j]*C[j])%=mod;
				if(j) (f[j-1]+=g[j]*D[j])%=mod;
			}
			ull tot=0;
			for(int j=0;j<=m;j++) tot+=f[j]*F[j]%mod;
			ans+=tot%mod*E[i+1]%mod;
		}
		printf("%llu\n",ans%mod);
	}
}

namespace MakeB{
	#define ls v<<1
	#define rs v<<1|1
	pair<poly,poly> dfs(int v=1,int l=0,int r=n){
		if(l==r) return make_pair(poly({E[l]}),l==n?poly({1}):poly({1,B[l]}));
		int m=l+r>>1;
		auto [f1,g1]=dfs(ls,l,m);
		auto [f2,g2]=dfs(rs,m+1,r);
		return make_pair(f1+(f2<<m-l+1)/g1,g1*g2);
	}
	void build(){
		E=dfs().fi;
	}
	#undef ls
	#undef rs
}
void Solve(){
	scanf("%d%d%d%d",&c,&n,&m,&p);
	A.resize(m);B.resize(n);C.resize(m+1);D.resize(m+1);E.resize(n+1);F.resize(m+1);
	for(int i=0;i<m;i++) scanf("%lld",&A[i]);
	for(int i=0;i<n;i++) scanf("%lld",&B[i]);
	for(int i=0;i<=m;i++) scanf("%lld",&C[i]);
	for(int i=1;i<=m;i++) scanf("%lld",&D[i]);
	for(int i=0;i<=n;i++) scanf("%lld",&E[i]);
	for(int i=0;i<=m;i++) scanf("%lld",&F[i]);
	MakeB::build();
	for(int i=0;i<=n;i++) gdb(E[i]);
	Sub1::Solve();
}
int main(){
	int t=1;
	// scanf("%d",&t);
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}