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;
const int Maxn = 2e5 + 100;
long long n, m, d, t, g[Maxn], r, l, T, f, mid;
pair<long long, long long> cv[Maxn];
vector<pair<long long, long long> > vec;
bool valid(long long x) {
  t = 0;
  for (int i = 1; i <= m + 1; i++) {
    f = g[i] - g[i - 1];
    if (f > x) return false;
    t += min(f, x - f);
    f = max(1ll * 0, f - (x - f));
    t += 2 * f;
  }
  if (t <= T) return true;
  return false;
}
int main() {
  ios::sync_with_stdio(false), cin.tie(0);
  cin >> n >> m >> d >> T;
  for (int i = 0, a, b; i < n; i++) {
    cin >> a >> b;
    cv[i] = make_pair(a, b);
  }
  for (int i = 1; i <= m; i++) cin >> g[i];
  g[m + 1] = d;
  sort(g + 1, g + m + 1);
  sort(cv, cv + n);
  for (int i = 0; i < n; i++) {
    if (vec.empty() || cv[i].second > vec.back().second)
      vec.push_back(make_pair(cv[i].first, cv[i].second));
  }
  r = (int)vec.size() - 1;
  while (r - l > 1) {
    mid = (r + l) / 2;
    if (valid(vec[mid].second))
      r = mid;
    else
      l = mid;
  }
  if (!valid(vec.back().second))
    cout << -1;
  else if (valid(vec[0].second))
    cout << vec[0].first;
  else
    cout << vec[r].first;
}
