#include <bits/stdc++.h>
using namespace std;

using ll = long long;
constexpr int P = 998244353;

struct Matrix {
	int x, y;
    vector<vector<int>> a;
	Matrix(int _x = 0, int _y = 0) : x(_x), y(_y) {
		a.resize(x, vector<int>(y, 0));
	}
	vector<int>& operator[](int p) { return a[p]; }
	void I() {
		for(int i = 0; i < x; i++)
			a[i][i] = 1;
	}
	friend Matrix operator+(Matrix a, Matrix b) {
		assert(a.x == b.x && a.y == b.y);
		Matrix c(a.x, a.y);
		for(int i = 0; i < a.x; i++)
			for(int j = 0; j < a.y; j++)
				c[i][j] = (a[i][j] + b[i][j]) % P;
		return c;
	}
	friend Matrix operator*(Matrix a, Matrix b) {
		assert(a.y == b.x);
		Matrix c(a.x, b.y);
        for(int k = 0; k < a.y; k++)
            for(int i = 0; i < a.x; i++)
                for(int j = 0; j < b.y; j++)
					c[i][j] = (c[i][j] + 1ll * a[i][k] * b[k][j]) % P;
		return c;
	}
} I;
Matrix qpow(Matrix a, long long b) {
	assert(a.x == a.y);
	Matrix ret(a.x, a.y); ret.I();
	while(b) {
		if(b & 1) ret = ret * a;
		a = a * a; b >>= 1;
	}
	return ret;
}
ostream& operator<<(ostream& os, Matrix a) {
    for(int i = 0; i < a.x; i++)
        for(int j = 0; j < a.y; j++)
            os << a[i][j] << " \n" [j == a.y - 1];
    return os;
}

ll exgcd(ll a, ll b, ll &x, ll &y) {
    if (b == 0) {
        x = 1;
        y = 0;
        return a;
    }
    ll g = exgcd(b, a % b, y, x);
    y -= a / b * x;
    return g;
}
ll inv(ll a, ll P) {
    ll x, y;
    exgcd(a, P, x, y);
    return (x % P + P) % P;
}

const int N = 500100;
Matrix a[N], tag[N];
int ls[N], rs[N], pd[N], tot;
int newnode() {
    tot++;
    a[tot] = I;
    ls[tot] = rs[tot] = pd[tot] = 0;
    return tot;
}
void init() {
    tot = -1;
    newnode(), newnode();
}
void pushdown(int k, int l, int mid, int r) {
    if(!ls[k]) ls[k] = newnode();
    if(!rs[k]) rs[k] = newnode();
    if(pd[k]) {
        a[ls[k]] = qpow(tag[k], mid - l + 1);
        a[rs[k]] = qpow(tag[k], r - mid);
        tag[ls[k]] = tag[rs[k]] = tag[k];
        pd[k] = 0, pd[ls[k]] = pd[rs[k]] = 1;
    }
}
void modify(int k, int l, int r, int L, int R, Matrix x) {
    if (L <= l && r <= R) {
        a[k] = qpow(x, r - l + 1);
        tag[k] = x, pd[k] = 1;
        return;
    }
    int mid = (l + r) >> 1;
    pushdown(k, l, mid, r);
    if(L <= mid) modify(ls[k], l, mid, L, R, x);
    if(R > mid) modify(rs[k], mid + 1, r, L, R, x);
    assert(a[rs[k]].y == a[ls[k]].x);
    a[k] = a[rs[k]] * a[ls[k]];
}

void solve() {
    int n, m, k, L;
    cin >> n >> m >> k >> L;
    I = Matrix(m + 1, m + 1), I.I();
    k = inv(k, L);
    vector<Matrix> initM(1001, I);
    vector<int> t(m + 1);
    for(int i = 1; i <= m; i++) {
        cin >> t[i];
        initM[t[i]][i][i - 1] = 1;
    }
    vector<int> l, r;
    vector<Matrix> M;
    for(int i = 1, s = 0; i <= n; i++) {
        int len, v;
        cin >> len >> v;
        l.push_back(s);
        r.push_back(s + len - 1);
        M.push_back(initM[v]);
        s += len;
    }
    auto slv = [&](auto self, int L, int k, vector<int> l, vector<int> r, vector<Matrix> M) {
        // cerr << "------------------- " << L << ' ' << k << ' ' << l.size() << '\n';
        // for(int i : l) cerr << i << ' '; cerr << '\n';
        // for(int i : r) cerr << i << ' '; cerr << '\n';
        // cerr << '\n';
        // for(Matrix i : M) cerr << i << "\n\n";
        if(L == 1) return M[0];
        if(2 * k > L) {
            vector<int> nl, nr;
            vector<Matrix> nM;
            nl.push_back(0), nr.push_back(0);
            nM.push_back(M[0]);
            l[0] = 1;
            for(int i = l.size() - 1; i >= 0; i--) {
                if(r[i] < l[i]) continue;
                nl.push_back(L - r[i]);
                nr.push_back(L - l[i]);
                nM.push_back(M[i]);
            }
            return self(self, L, L - k, nl, nr, nM);
        }
        init();
        int n = l.size(), cnt = (L + k - 1) / k;
        using T = pair<int, pair<int, Matrix>>;
        vector<T> ve; // <ti, pos, M>
        for(int i = 0; i < n; i++) {
            if((l[i] + k - 1) / k <= r[i] / k) {
                modify(1, 0, cnt - 1, (l[i] + k - 1) / k, r[i] / k, M[i]);
            }
            if(l[i] % k != 0) {
                ve.push_back({l[i] % k, {l[i] / k, M[i]}});
            }
        }
        // cerr << "---\n";
        // for(int i = 0; i < k; i++) {
        //     Matrix c = I;
        //     for(int j = i; j < L; j += k) {
        //         int id = lower_bound(r.begin(), r.end(), j) - r.begin();
        //         c = M[id] * c;
        //     }
        //     cerr << c << '\n';
        // }
        // cerr << "---\n";
        if(L % k != 0) {
            ve.push_back({L % k, {cnt - 1, I}});
        }
        sort(ve.begin(), ve.end(), [&](T a, T b) {
            return a.first < b.first;
        });
        ve.push_back({k, {0, I}});
        vector<int> nl, nr;
        vector<Matrix> nM;
        for(int i = 0, lst = 0; i < ve.size(); i++) {
            auto [ti, _] = ve[i];
            auto [pos, tM] = _;
            if(i == 0 || ti != ve[i - 1].first) {
                nl.push_back(lst);
                nr.push_back(ti - 1);
                nM.push_back(a[1]);
                lst = ti;
            }
            if(i + 1 < ve.size()) {
                modify(1, 0, cnt - 1, pos, pos, tM);
            }
        }
        return self(self, k, k - L % k, nl, nr, nM);
    };
    auto res = slv(slv, L, k, l, r, M);
    cout << res[m][0] << '\n';
    // Matrix c = I;
    // for(int i = 0, j = 0; i < L; i++, j = (j + k) % L) {
    //     int id = lower_bound(r.begin(), r.end(), j) - r.begin();
    //     c = M[id] * c;
    // }
    // cerr << c << '\n';
}
signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    int t = 1;
    // cin >> t;
    while(t--) solve();
    return 0;
}