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, s, t, c[200005], v[200005], g[200005], mg, ans = 1e9 + 1, mv;
bool ck(int v) {
  if (v < mg) return 0;
  int tol = 0;
  for (int i = 1; i <= k + 1; i++) {
    tol += max(g[i], 3 * g[i] - v);
    if (tol > t) return 0;
  }
  return 1;
}
int main() {
  scanf("%d%d%d%d", &n, &k, &s, &t);
  for (int i = 1; i <= n; i++) scanf("%d%d", c + i, v + i);
  for (int i = 1; i <= k; i++) scanf("%d", g + i);
  sort(g + 1, g + k + 1);
  g[k + 1] = s;
  mg = 0;
  for (int i = k + 1; i; i--) mg = max(mg, g[i] -= g[i - 1]);
  int l = 0, r = 1e9, m;
  while (l <= r) {
    m = (l + r) / 2;
    if (ck(m)) {
      r = m - 1;
      mv = m;
    } else {
      l = m + 1;
    }
  }
  if (mv)
    for (int i = 1; i <= n; i++)
      if (v[i] >= mv) ans = min(ans, c[i]);
  if (ans > 1e9) ans = -1;
  printf("%d", ans);
  return 0;
}
