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;
vector<int> coor;
bool can(int w) {
  int tm = 0;
  if (coor[0] > w) return 0;
  int x = coor[0];
  tm += min(x, w - x);
  x -= min(x, w - x);
  tm += 2 * x;
  for (int i = 0; i < k; i++) {
    int x = coor[i + 1] - coor[i];
    if (x > w) return 0;
    tm += min(x, w - x);
    x -= min(x, w - x);
    tm += 2 * x;
  }
  if (tm > t) return 0;
  return 1;
}
int bin_search() {
  int l = -1, r = 1e9 + 1;
  while (r - l > 1) {
    int m = (r + l) / 2;
    if (can(m))
      r = m;
    else
      l = m;
  }
  return l;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> k >> s >> t;
  vector<pair<int, int> > car(n);
  for (int i = 0; i < n; i++) cin >> car[i].first >> car[i].second;
  coor.resize(k);
  for (int i = 0; i < k; i++) cin >> coor[i];
  coor.push_back(s);
  sort(coor.begin(), coor.end());
  int w = bin_search();
  w++;
  int ans = 1e9 + 1;
  for (int i = 0; i < n; i++)
    if (car[i].second >= w) ans = min(ans, car[i].first);
  if (ans == 1e9 + 1)
    cout << -1 << endl;
  else
    cout << ans << endl;
  return 0;
}
