// 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 int long long
#define ull unsigned 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 200005
#define inf 0x3f3f3f3f

modint f[505][505];
modint det(modint a[505][505],int n)
{
	modint res=1;
	For(j,1,n){
		For(i,j,n)
			if(a[i][j].x){
				if(i!=j)swap(a[i],a[j]),res=-res;
				break;
			}
		if(!a[j][j].x)return 0;
		res*=a[j][j];
		modint iv=1/a[j][j];
		For(i,j+1,n){
			modint tmp=a[i][j]*iv;
			For(k,j,n)a[i][k]-=a[j][k]*tmp;
		}
	}
	return res;
}

int n,m,n1,n2;
int a[maxn],b[maxn];
int sx[maxn],sy[maxn],tx[maxn],ty[maxn];

/*
consider only one Special Edge.
the ans is: ( (0,a) -> (x,y+1) ) multiply ( (x,y) -> (n,b) ).
consider multiple edges.
the ans is a det.
*/

modint F(int x,int y){
	if(x<0||y<0)return 0;
	return C(x+y,y);
}

signed main()
{
	n=read(),m=read(),n1=read(),n2=read();
	For(i,1,n1)a[i]=read();
	For(i,1,n1)b[i]=read();
	For(i,1,n1)sx[i]=1,sy[i]=a[i],tx[i]=n,ty[i]=b[i];
	For(i,1,n2){
		int x=read(),y=read();
		sx[i+n1]=x,sy[i+n1]=y;
		tx[i+n1]=x,ty[i+n1]=y+1;
	}
	For(i,1,n1+n2)
		For(j,1,n1+n2){
			if(i==j && i>n1) continue;
			f[i][j]=F(tx[j]-sx[i],ty[j]-sy[i]);
			if(j>n1) f[i][j]=-f[i][j];
		}
//	For(i,1,n1+n2){
//		For(j,1,n1+n2){
//			cout<<f[i][j].x<<" \n"[j==n1+n2];
//		}
//	}
	modint res=det(f,n1+n2);
	cout<<res.x;
	return 0;
}
/*

*/