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;
vector<int> g;
int n, k, s, t;
bool check(long long v) {
  int cur = 0;
  long long res = 0;
  for (auto go : g) {
    int dist = go - cur;
    int l = 0, r = dist + 1;
    while (l < r - 1) {
      long long m = (l + r) / 2;
      if (2 * m + (dist - m) <= v) {
        l = m;
      } else {
        r = m;
      }
    }
    if (2 * l + (dist - l) > v) {
      return 0;
    }
    res += l + 2 * (dist - l);
    cur = go;
  }
  return res <= t;
}
int main() {
  ios::sync_with_stdio(0);
  cin >> n >> k >> s >> t;
  vector<pair<int, int> > cv;
  for (int i = 0; i < n; i++) {
    int c, v;
    cin >> c >> v;
    cv.push_back({c, v});
  }
  for (int i = 0; i < k; i++) {
    int x;
    cin >> x;
    g.push_back(x);
  }
  g.push_back(s);
  sort(g.begin(), g.end());
  long long l = -1, r = 2e9 + 7;
  while (l < r - 1) {
    long long m = (l + r) / 2;
    if (check(m)) {
      r = m;
    } else {
      l = m;
    }
  }
  int res = 2e9;
  for (int i = 0; i < n; i++) {
    if (cv[i].second >= r) {
      res = min(res, cv[i].first);
    }
  }
  cout << (res == 2e9 ? -1 : res) << '\n';
}
