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;
long long int mod = 1000000007;
long long n, k, s, t;
pair<long long, long long> c[200003];
long long x[200004];
int check(long long i) {
  long h = c[i].first;
  long long to = 0;
  for (long j = 1; j <= k; j++) {
    long long f = x[j] - x[j - 1];
    if (f > h) return 0;
    long long p = h - f;
    if (p > f) p = f;
    to = to + p + (f - p) * 2LL;
  }
  if (to <= t) return 1;
  return 0;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> k >> s >> t;
  for (long i = 1; i <= n; i++) {
    cin >> c[i].second >> c[i].first;
  }
  for (long i = 1; i <= k; i++) cin >> x[i];
  sort(x + 1, x + k + 1);
  x[0] = 0;
  k++;
  x[k] = s;
  sort(c + 1, c + n + 1);
  long l = 0;
  long r = n;
  if (check(n) == 0) {
    cout << "-1" << endl;
    return 0;
  }
  while (r - l > 1) {
    long mid = (l + r) / 2;
    if (check(mid))
      r = mid;
    else
      l = mid;
  }
  long mm = c[r].second;
  for (long i = 1; i <= n; i++) {
    if (c[i].first >= c[r].first && c[i].second < mm) mm = c[i].second;
  }
  cout << mm << endl;
}
