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 inf = 2100000000;
int s, t, ans, i, j, k, n, m, a[310001], mid, b[310001], g[310001], l, r;
bool check(int x) {
  int i, j, k = 0;
  for (i = 1; i <= m + 1; i++) {
    if (g[i] - g[i - 1] > x) return 0;
    k += min(x - g[i] + g[i - 1], g[i] - g[i - 1]);
  }
  return k >= 2LL * (long long)s - t;
}
int main() {
  scanf("%d%d%d%d", &n, &m, &s, &t);
  for (k = 0, i = 1; i <= n; i++) scanf("%d%d", &a[i], &b[i]), k = max(k, b[i]);
  for (i = 1; i <= m; i++) scanf("%d", &g[i]);
  sort(g + 1, g + 1 + m);
  g[0] = 0;
  g[m + 1] = s;
  if (!check(k)) {
    puts("-1");
    return 0;
  }
  for (l = 0, r = k; l < r - 1;) {
    mid = ((long long)l + (long long)r) / 2LL;
    if (check(mid))
      r = mid;
    else
      l = mid + 1;
  }
  k = (check(l)) ? l : r;
  for (i = 1, ans = inf; i <= n; i++)
    if (b[i] >= k) ans = min(ans, a[i]);
  printf("%d\n", ans);
  return 0;
}
