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;
int n, K, L, T, ans;
int car[200010][2], gas[200010];
bool check(int fuel) {
  int i, d, t = 0;
  for (i = 1; i <= K; i++) {
    d = gas[i] - gas[i - 1];
    if (d * 2 <= fuel)
      t += d;
    else if (d > fuel)
      return false;
    else
      t += (fuel - d) + 2 * (2 * d - fuel);
  }
  return t <= T;
}
int work() {
  int head = 1, tail = 1e9 + 7, mid;
  while (head < tail) {
    mid = (head + tail) >> 1;
    if (check(mid))
      tail = mid;
    else
      head = mid + 1;
  }
  return head;
}
int main() {
  int i, lim;
  scanf("%d%d%d%d", &n, &K, &L, &T);
  for (i = 1; i <= n; i++) scanf("%d%d", &car[i][0], &car[i][1]);
  for (i = 1; i <= K; i++) scanf("%d", &gas[i]);
  sort(gas + 1, gas + 1 + K);
  gas[++K] = L;
  lim = work();
  ans = 1e9 + 7;
  for (i = 1; i <= n; i++)
    if (car[i][1] >= lim) ans = min(ans, car[i][0]);
  printf("%d", ans < 1e9 + 7 ? ans : -1);
  return 0;
}
