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 main() {
  ios_base::sync_with_stdio(false);
  int cars_cnt, fs_cnt, distance, til_time;
  cin >> cars_cnt >> fs_cnt >> distance >> til_time;
  vector<pair<int, int>> cars;
  cars.reserve(cars_cnt);
  for (int i = 0; i < cars_cnt; i++) {
    int ci, vi;
    cin >> ci >> vi;
    cars.push_back(make_pair(vi, ci));
  }
  vector<int> gas_stations;
  gas_stations.reserve(fs_cnt);
  for (int i = 0; i < fs_cnt; i++) {
    int tmp;
    cin >> tmp;
    gas_stations.push_back(tmp);
  }
  gas_stations.push_back(distance);
  sort(gas_stations.begin(), gas_stations.end());
  sort(cars.begin(), cars.end());
  int l = -1, r = cars_cnt, m;
  while (r - l > 1) {
    m = l + (r - l) / 2;
    int t = 0;
    int fuel_max = cars[m].first;
    int p = 0;
    int dist = 0;
    bool ok = true;
    while (p < gas_stations.size()) {
      int travel = gas_stations[p] - dist;
      if (travel > fuel_max) {
        ok = false;
        break;
      }
      t += 2 * travel - min(travel, fuel_max - travel);
      dist = gas_stations[p];
      p++;
    }
    if (t <= til_time && ok) {
      r = m;
    } else {
      l = m;
    }
  }
  int mm = 1000000001;
  for (int i = r; i < cars_cnt; i++) {
    if (cars[i].second < mm) {
      mm = cars[i].second;
    }
  }
  if (mm == 1000000001) {
    cout << -1 << endl;
  } else {
    cout << mm << endl;
  }
}
