#include <bits/stdc++.h>
typedef std::vector<int> vector;
typedef std::vector<vector> matrix;
constexpr int mod = 998244353;
void inc (int &x, int y) {if ((x += y) >= mod) x -= mod;}
int m; matrix identity;
matrix operator * (matrix A, matrix B) {
	matrix C(m + 1, vector(m + 1));
	for (int i = 0; i <= m; i++) for (int k = 0; k <= m; k++) for (int j = 0; j <= m; j++) C[i][k] = (C[i][k] + 1LL * A[i][j] * B[j][k]) % mod;
	return C;
}
matrix power (matrix A, int k) {
	matrix B = identity;
	for (; k; k >>= 1, A = A * A) if (k & 1) B = B * A;
	return B;
}
void exgcd (int a, int b, int &x, int &y) {
	if (!b) {x = 1; y = 0; return;}
	exgcd(b, a % b, y, x); y -= a / b * x;
}
int inv (int r, int L) {int x, y; exgcd(r, L, x, y); return (x + L) % L;}
matrix solve (int r, int L, std::deque<std::pair<int, matrix>> q) {
	if (L == 1) return q[0].second;
	if (2 * r > L) {
		auto [l, v] = q.front(); q.pop_front();
		if (l > 1) q.push_front({l - 1, v});
		std::reverse(q.begin(), q.end()); q.push_front({1, v});
		return solve(L - r, L, q);
	}
	int n = q.size(), m = 1; while (m < n) m <<= 1;
	std::vector<int> c(n); std::vector<matrix> tr(m << 1, identity), P(n);
	for (int i = 0; i < n; i++) P[i] = q[i].second;
	std::vector<std::tuple<int, int, int>> events;
	for (int i = 0, p = 0; i < n; i++) {
		if (p % r) events.emplace_back(p % r, i, 1);
		events.emplace_back(0, i, (p + q[i].first + r - 1) / r - (p + r - 1) / r);
		p += q[i].first;
		if (p % r) events.emplace_back(p % r, i, -1);
	}
	std::sort(events.begin(), events.end()); events.emplace_back(r, -1, 0);
	q.clear();
	for (int ql = 0, qr; ql < (int)events.size() - 1; ql = qr) {
		for (qr = ql; qr < (int)events.size() and std::get<0>(events[qr]) == std::get<0>(events[ql]); qr++) ;
		for (int i = ql; i < qr; i++) if (auto [t, p, v] = events[i]; ~p) {
			c[p] += v; tr[m + p] = power(P[p], c[p]);
			for (int k = (m + p) >> 1; k; k >>= 1) tr[k] = tr[k << 1] * tr[k << 1 | 1];
		}
		q.emplace_back(std::get<0>(events[qr]) - std::get<0>(events[ql]), tr[1]);
	}
	return solve(r - L % r, r, q);
}
signed main () {
	std::ios::sync_with_stdio(false); std::cin.tie(nullptr); std::cout.tie(nullptr);
	int n, r, L; std::cin >> n >> m >> r >> L; r = inv(r, L);
	identity = matrix(m + 1, vector(m + 1)); for (int i = 0; i <= m; i++) identity[i][i] = 1;
	std::array<matrix, 1001> tr; std::fill(tr.begin(), tr.end(), identity);
	for (int i = 0, v; i < m; i++) std::cin >> v, tr[v][i][i + 1] = 1;
	std::deque<std::pair<int, matrix>> q(n);
	for (int i = 0, v; i < n; i++) std::cin >> q[i].first >> v, q[i].second = tr[v];
	std::cout << solve(r, L, q)[0][m] << std::endl;
	return 0;
}