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::sync_with_stdio(false);
  cin.tie(0);
  long long n, k, s, m;
  cin >> n >> k >> s >> m;
  vector<pair<long long, long long> > a(n);
  for (long long i = 0; i < n; i++) cin >> a[i].first >> a[i].second;
  sort(a.begin(), a.end());
  for (long long i = 1; i < n; i++)
    a[i].second = max(a[i].second, a[i - 1].second);
  vector<long long> b(k);
  for (long long i = 0; i < k; i++) cin >> b[i];
  b.push_back(0);
  b.push_back(s);
  k += 2;
  sort(b.begin(), b.end());
  long long l = 0, r = n;
  while (l != r) {
    long long t = (l + r) / 2;
    long long v = a[t].second;
    long long q = 0;
    bool good = true;
    for (long long i = 0; i < k - 1; i++) {
      long long d = b[i + 1] - b[i];
      if (d > v) {
        good = false;
        break;
      }
      q += max(d, d * 2 - (v - d));
    }
    if (good && q <= m)
      r = t;
    else
      l = t + 1;
  }
  if (l == n)
    cout << -1;
  else
    cout << a[l].first;
  return 0;
}
