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;
inline int read() {
  int x = 0, f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = x * 10 + ch - '0';
    ch = getchar();
  }
  return x * f;
}
int c[200100], v[200100], g[200100];
int n, k, s, t;
bool check(long long x) {
  long long tt = 0;
  for (int i = 1; i <= k + 1; i++) {
    int dist = g[i] - g[i - 1];
    if (x >= dist * 2) {
      tt += dist;
    } else if (x >= dist) {
      tt += (x - dist) + (dist - x + dist) * 2;
    } else
      return false;
  }
  return tt <= t;
}
int main() {
  n = read();
  k = read();
  s = read();
  t = read();
  for (int i = 1; i <= n; i++) {
    c[i] = read();
    v[i] = read();
  }
  for (int i = 1; i <= k; i++) g[i] = read();
  sort(g + 1, g + 1 + k);
  g[k + 1] = s;
  long long l = 1, r = 2e9, mid;
  while (l + 5 < r) {
    mid = (l + r) >> 1;
    if (check(mid))
      r = mid;
    else
      l = mid;
  }
  int lb = l;
  for (int i = l; i <= r; i++) {
    if (check(i)) {
      lb = i;
      break;
    }
  }
  long long mn = 2e9;
  for (int i = 1; i <= n; i++) {
    if (v[i] >= lb) mn = min(mn, 1ll * c[i]);
  }
  if (mn == 2e9) mn = -1;
  cout << mn << endl;
  return 0;
}
