#include<bits/stdc++.h>
#define L(i, j, k) for(int i = (j); i <= (k); ++i)
#define R(i, j, k) for(int i = (j); i >= (k); --i)
#define ll long long
#define vi vector <int>
#define sz(a) ((int) (a).size())
#define me(f, x) memset(f, x, sizeof(f))
#define uint unsigned int
#define ull unsigned long long 
#define bs bitset < N >
using namespace std;
const int N = 507, mod = 998244353;
int qpow(int x, int y = mod - 2) {
	int res = 1;
	for(; y; x = (ll) x * x % mod, y >>= 1) if(y & 1) res = (ll) res * x % mod;
	return res;
}
int fac[N], ifac[N], inv[N];
void init(int x) {
	fac[0] = ifac[0] = inv[1] = 1;
	L(i, 2, x) inv[i] = (ll) (mod - mod / i) * inv[mod % i] % mod;
	L(i, 1, x) fac[i] = (ll) fac[i - 1] * i % mod, ifac[i] = (ll) ifac[i - 1] * inv[i] % mod;
} 
int C(int x, int y) {
	return x < y || y < 0 ? 0 : (ll) fac[x] * ifac[y] % mod * ifac[x - y] % mod;
}

int f[N][N];
int det(int m) {
	int ns = 1;
	L(i, 1, m) {
		int cs = 0;
		L(j, i, m) if(f[j][i]) {
			cs = j;
			break;
		}
		if(!cs) return 0;
		if(cs != i) ns = mod - ns, swap(f[i], f[cs]);
		ns = (ll) ns * f[i][i] % mod;
		int Iv = qpow(f[i][i]);
		L(j, i, m) f[i][j] = (ll) f[i][j] * Iv % mod;
		L(j, i + 1, m) R(k, m, i) 
			(f[j][k] += mod - (ll) f[i][k] * f[j][i] % mod) %= mod; 
	}
	return ns;
}

int n, m, l, k;
int a[N], b[N], x[N], y[N];
inline int way(int x, int y) {
	return C(x + y, x);
} 
int aX[N], aY[N];
int bX[N], bY[N]; 
int main() {
	ios :: sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	init(500);
	cin >> n >> m >> l >> k;
	L(i, 1, l) {
		cin >> a[i];
	}
	L(i, 1, l) {
		cin >> b[i];
	}
	L(i, 1, k) {
		cin >> x[i] >> y[i];
	}
	L(i, 1, l) {
		aX[i] = 1, aY[i] = a[i];
		bX[i] = n, bY[i] = b[i];
	}
	L(i, 1, k) {
		aX[i + l] = x[i], aY[i + l] = y[i];
		bX[i + l] = x[i], bY[i + l] = y[i] + 1;
	}
	L(i, 1, k + l) {
		L(j, 1, k + l) {
			int w = way(bX[j] - aX[i], bY[j] - aY[i]);
			if(j > l) {
				w = (ll) w * (mod - 1) % mod;
			}
			(f[i][j] += w) %= mod;
		}
	}
	L(i, l + 1, k + l) {
		(f[i][i] += 1) %= mod;
	}
//	L(i, 1, k + l) {
//		L(j, 1, k + l) {
//			cout << f[i][j] << ' ';
//		}
//		cout << endl;
//	} 
//	cout << endl;
	cout << det(k + l) << '\n';
	return 0;
}