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;
pair<long long, long long> a[200 * 1000 + 7];
long long b[200 * 1000 + 7];
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long n, k, s, T, t, i, j, L, M, R, ans = INT_MAX;
  cin >> n >> k >> s >> T;
  for (i = 1; i <= n; i++) cin >> a[i].first >> a[i].second;
  for (i = 1; i <= k; i++) cin >> b[i];
  sort(b + 1, b + k + 1);
  b[k + 1] = s;
  L = 0;
  R = 1000 * 1000 * 1000;
  t = 0;
  for (i = 1; i <= k + 1; i++) {
    t +=
        2 * (b[i] - b[i - 1]) - min(R - (b[i] - b[i - 1]), b[i] - b[i - 1]) * 1;
  }
  if (t > T) {
    cout << -1;
    return 0;
  }
  while (R - L > 1) {
    M = (L + R) / 2;
    t = 0;
    for (i = 1; i <= k + 1; i++) {
      if (b[i] - b[i - 1] > M) {
        L = M;
        goto m1;
      }
      t += 2 * (b[i] - b[i - 1]) -
           min(M - (b[i] - b[i - 1]), b[i] - b[i - 1]) * 1;
    }
    if (t <= T)
      R = M;
    else
      L = M;
  m1:;
  }
  for (i = 1; i <= n; i++)
    if (a[i].second >= R && a[i].first < ans) ans = a[i].first;
  if (ans == INT_MAX)
    cout << -1;
  else
    cout << ans;
}
