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 g[200001];
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, k, t, s, el;
  cin >> n >> k >> s >> t;
  vector<pair<int, int>> v(n);
  for (int i = 0; i < n; i++) {
    cin >> v[i].first >> v[i].second;
  }
  for (int i = 0; i < k; i++) {
    cin >> g[i + 1];
  }
  g[k + 1] = s;
  sort(g, g + k + 2);
  int l = 0, r = 2e9 + 2;
  while (r - l > 1) {
    int m = (l + (r - l) / 2);
    bool f = 1;
    long long curt = 0;
    for (int i = 0; i < k + 1; i++) {
      if (g[i + 1] - g[i] > m) {
        f = 0;
        break;
      } else
        curt +=
            2 * (g[i + 1] - g[i]) - min(m - g[i + 1] + g[i], g[i + 1] - g[i]);
    }
    if (curt <= t && f) {
      r = m;
    } else {
      l = m;
    }
  }
  int mn = 2e9 + 2;
  for (int i = 0; i < n; i++) {
    if (v[i].second >= r) {
      mn = min(mn, v[i].first);
    }
  }
  if (mn == 2e9 + 2)
    cout << -1;
  else
    cout << mn;
  return 0;
}
