1 1 2 2
1000000000 1000000000
1
 1 1 1000000000 1000000000
100 1000000000
1
 1 1 10 18
5 6
5
 2 1 1000000000 2000000000
111 999999999
101 999999998
1
 4 13 400 600
13 30
1 19
1 160
1 113
58 73 15 319 194 362 128 157 336 162 77 90 96
 1 15 100 200
283 8
30 58 16 45 80 82 55 95 24 23 86 28 51 47 20
 3 2 300 400
24 68
13 65
15 113
127 177
 1 1 2 1
1 10
1
 4 2 7 15
10 9
4 4
9 3
4 10
1 6
 2 1 1000000000 2000000000
111 1000000000
101 1000000000
5
 2 1 1000000000 2000000000
111 999999998
101 999999998
1
 1 1 1000000000 1000000000
1 1000000000
1

1000000000
 -1
 5
 111
 1
 -1
 -1
 -1
 4
 101
 -1
 -1

#include <bits/stdc++.h>
using namespace std;
const int MAXN = 200005;
int g[MAXN];
int p[MAXN];
int c[MAXN];
int dis[MAXN];
int dis2[MAXN];
int ds[MAXN];
int main() {
  int n, k, s, t;
  scanf("%d %d %d %d", &n, &k, &s, &t);
  for (int i = 0; i < n; i++) scanf("%d %d", p + i, c + i);
  for (int i = 0; i < k; i++) scanf("%d", g + i);
  sort(g, g + k);
  for (int i = 0; i < k; i++) {
    dis[i] = g[i];
    if (i) dis[i] -= g[i - 1];
    dis2[i] = 2 * dis[i];
  }
  dis[k] = s - g[k - 1];
  dis2[k] = 2 * dis[k];
  sort(dis, dis + k + 1);
  sort(dis2, dis2 + k + 1);
  ds[0] = dis[0];
  for (int i = 1; i <= k; i++) ds[i] = dis[i] + ds[i - 1];
  int mn = 1000000005;
  for (int i = 0; i < n; i++) {
    if (c[i] < dis[k]) continue;
    long long save = 0;
    int ind = upper_bound(dis2, dis2 + k + 1, c[i]) - dis2;
    ind--;
    if (ind >= 0) save += ds[ind];
    int rem = k - ind;
    int rest = ds[k];
    if (ind >= 0) rest -= ds[ind];
    save += rem * 1ll * c[i] - rest;
    if (2 * s - save <= t) mn = min(mn, p[i]);
  }
  if (mn <= 1000000000)
    printf("%d\n", mn);
  else
    printf("-1\n");
}
