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<pair<int, int> > vec;
vector<int> gas;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0), cout.tie(0);
  cin >> n >> k >> s >> t;
  vec.resize(n);
  gas.resize(k + 1);
  gas[0] = 0;
  for (int i = 0; i < n; i++) cin >> vec[i].second >> vec[i].first;
  sort(vec.begin(), vec.end());
  for (int i = 1; i <= k; i++) cin >> gas[i];
  gas.push_back(s);
  sort(gas.begin(), gas.end());
  int s = 0, e = n - 1, ans = n + 1;
  while (s <= e) {
    int mid = (s + e) / 2;
    int tank = vec[mid].first, tim = 0;
    bool flag = 0;
    for (int i = 0; i < gas.size() - 1; i++) {
      int dis = gas[i + 1] - gas[i];
      if (tank < dis) {
        flag = 1;
        break;
      }
      if (dis * 2 <= tank) {
        tim += dis;
        if (tim > t) {
          flag = 1;
          break;
        }
        continue;
      }
      int z = tank - dis;
      tim += z;
      tim += 2 * (dis - z);
      if (tim > t) {
        flag = 1;
        break;
      }
    }
    if (flag)
      s = mid + 1;
    else
      e = mid - 1, ans = min(ans, mid);
  }
  if (ans == n + 1) return cout << -1, 0;
  int mi = 1e9;
  for (int i = ans; i < n; i++) {
    mi = min(mi, vec[i].second);
  }
  cout << mi;
  return 0;
}
