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;
using LL = long long;
constexpr int N = 1e5 + 5;
int n, g, L, t;
vector<pair<int, int>> cars;
vector<int> gas;
vector<int> distances;
bool possible(int v) {
  const int capacity = v;
  LL T = 0;
  for (auto D : distances) {
    if (D > capacity) return false;
    LL x = min(D, capacity - D);
    LL y = D - x;
    T += x + 2 * y;
    assert(x + y == D);
    assert(capacity >= 2 * x + y);
  }
  if (T > t) return false;
  return true;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cin >> n >> g >> L >> t;
  cars.resize(n);
  gas.resize(g);
  for (auto& p : cars) cin >> p.second >> p.first;
  for (auto& p : gas) cin >> p;
  gas.push_back(0);
  gas.push_back(L);
  g += 2;
  sort(begin(cars), end(cars));
  sort(begin(gas), end(gas));
  for (int i = 0; i + 1 < g; i++) {
    distances.push_back(gas[i + 1] - gas[i]);
  }
  int v = -1;
  int l = 1, r = 1e9;
  while (l <= r) {
    int m = (l + r) / 2;
    if (possible(m)) {
      v = m;
      r = m - 1;
    } else {
      l = m + 1;
    }
  }
  if (v == -1)
    cout << -1;
  else {
    int ans = 2e9 + 7;
    for (int i = 0; i < n; i++)
      if (cars[i].first >= v) ans = min(ans, cars[i].second);
    cout << ans << endl;
  }
}
