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 = 1e9 + 7;
int main() {
  ios_base::sync_with_stdio(0);
  int n, k, s, t;
  cin >> n >> k >> s >> t;
  vector<pair<int, int> > data(n);
  for (int i = 0; i < n; i++) {
    cin >> data[i].first >> data[i].second;
  }
  sort(data.begin(), data.end());
  vector<int> d(k);
  for (int i = 0; i < k; i++) {
    cin >> d[i];
  }
  sort(d.begin(), d.end());
  d.push_back(s);
  k++;
  int l = 0, r = INF;
  while (r - l > 1) {
    int mid = (r + l) / 2;
    int left = 0;
    int time = 0;
    bool fl = 0;
    for (int i = 0; i < k; i++) {
      int rast = d[i] - left;
      int x = mid;
      left = d[i];
      if (x < rast) {
        fl = 1;
        break;
      }
      x -= rast;
      if (rast <= x) {
        time += rast;
      } else {
        time += x + (rast - x) * 2;
      }
    }
    if (!fl && time <= t) {
      r = mid;
    } else {
      l = mid;
    }
  }
  for (int i = 0; i < n; i++) {
    if (data[i].second >= r) {
      cout << data[i].first << endl;
      return 0;
    }
  }
  cout << -1;
}
