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

typedef long long ll;
const int N = 202020;

int n, m, k, p, a[N], b[N], nxt[N], vis[N], dep[N];
ll cr[20][N], pr[20][N], cl[20][N], pl[20][N];
pair<int, int> tmp[N], c[2 * N];

int dfs(int v) {
    vis[v] = 1;
    int x = nxt[v];
    if (vis[x] == 1) {
        vis[v] = 2;
        return dep[v] - dep[x] + 1;
    }
    else if (!vis[x]) {
        dep[x] = dep[v] + 1;
        int r = dfs(x);
        if (r) {
            vis[v] = 2;
            return r;
        }
    }
    vis[v] = 2;
    return 0;
}
int main() {
    cin.tie(0); ios_base::sync_with_stdio(0);
    cin >> n >> m >> k >> p;
    for (int i = 0; i < m; i++) {
        int x; cin >> x;
        cin >> a[x - 1];
    }
    ll s = 0;
    for (int i = 0, j = 0; i < n; i++) {
        if (i == j) {
            j = (j + 1) % n;
            s += a[j] + 1;
        }
        while (i != j && a[j]) {
            j = (j + 1) % n;
            s += a[j] + 1;
        }
        pr[0][i] = j;
        cr[0][i] = s;
        if (i != n - 1) {
            s -= a[i + 1] + 1;
        }
    }
    s = 0;
    for (int i = n - 1, j = n - 1; i >= 0; i--) {
        if (i == j) {
            j = (j + n - 1) % n;
            s += a[j] + 1;
        }
        while (i != j && a[j]) {
            j = (j + n - 1) % n;
            s += a[j] + 1;
        }
        pl[0][i] = j;
        cl[0][i] = s;
        if (i != 0) {
            s -= a[i - 1] + 1;
        }
    }
    for (int j = 1; j < 20; j++) for (int i = 0; i < n; i++) {
        cl[j][i] = cl[j - 1][i] + cl[j - 1][pl[j - 1][i]];
        cr[j][i] = cr[j - 1][i] + cr[j - 1][pr[j - 1][i]];
        pl[j][i] = pl[j - 1][pl[j - 1][i]];
        pr[j][i] = pr[j - 1][pr[j - 1][i]];
    }
    for (int i = 0; i < k; i++) {
        cin >> b[i];
        b[i]--;
    }
    
    sort(b, b + k);

    ll L = 0, R = 2e10;
    while (L < R) {
        ll M = (L + R) / 2;
        int sz = 0;
        for (int i = 0; i < k; i++) {
            ll x = M, y = M, p = b[i], q = b[i];
            int s = 0, t = 0;
            for (int j = 19; j >= 0; j--) {
                if (cl[j][p] <= x) {
                    x -= cl[j][p];
                    p = pl[j][p];
                    s += 1 << j;
                }
                if (cr[j][q] <= y) {
                    y -= cr[j][q];
                    q = pr[j][q];
                    t += 1 << j;
                }
            }
            if (s + t >= n - m - 1) {
                continue;
            }
            while (p > q) {
                q += n;
            }
            tmp[sz++] = { p, q };
        }
        if (sz == 0) {
            R = M;
            continue;
        }

        int tz = 0;
        for (int i = 0; i < sz; i++) {
            if (i && tmp[i].first < tmp[i - 1].first) {
                tmp[i].first += n;
                tmp[i].second += n;
            }
            while (tz && c[tz - 1].second >= tmp[i].second) {
                --tz;
            }
            c[tz++] = tmp[i];
        }
        for (int i = 0; i < tz; i++) {
            c[i + tz] = c[i];
            c[i + tz].first += n;
            c[i + tz].second += n;
        }
        for (int i = 0, j = 0; i < tz; i++) {
            if (i == j) ++j;
            while (j < tz + i && c[j].first <= c[i].second) {
                ++j;
            }
            nxt[i] = j % tz;
        }
        bool f = true;
        for (int i = 0; i < tz; i++) {
            if (nxt[i] == i) f = false;
        }
        if (!f) {
            R = M; continue;
        }

        int ans = 0;
        fill(vis, vis + tz, 0);
        for (int i = 0; i < tz; i++) {
            if (!vis[i]) {
                int r = dfs(i);
                ans = max(ans, r);
            }
        }
        if (ans <= p) R = M;
        else L = M + 1;
    }
    cout << L;
}