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;
long long d[200010];
int v[200010], c[200010], b[200010], g[200010];
bool check(int x) {
  int i;
  long long tt = 0;
  for (i = 1; i <= k + 1; i++) {
    if (x < d[i]) return 0;
    if (x >= 2 * d[i])
      tt += d[i];
    else
      tt += 3 * d[i] - x;
  }
  if (tt <= t) return 1;
  return 0;
}
int main() {
  int i;
  scanf("%d%d%d%d", &n, &k, &s, &t);
  for (i = 1; i <= n; i++) {
    scanf("%d%d", &c[i], &v[i]);
  }
  for (i = 1; i <= k; i++) {
    scanf("%d", &g[i]);
  }
  sort(g + 1, g + k + 1);
  g[0] = 0;
  g[k + 1] = s;
  for (i = 1; i <= k + 1; i++) {
    d[i] = g[i] - g[i - 1];
  }
  int l = 1, r = 1e9 + 1, mn = 1e9 + 1;
  while (l <= r) {
    int mid = (l + r) >> 1;
    if (check(mid)) {
      mn = mid;
      r = mid - 1;
    } else
      l = mid + 1;
  }
  int ans = 1e9 + 1;
  for (i = 1; i <= n; i++) {
    if (v[i] >= mn && c[i] < ans) ans = c[i];
  }
  if (ans > 1e9) ans = -1;
  printf("%d\n", ans);
  return 0;
}
