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 n, m, s, t;
long long ans1[200009], ans2[200009];
long long pos[200009];
bool check(long long mid) {
  long long cnt = 0;
  for (int i = 0; i < m + 1; i++) {
    long long k = pos[i + 1] - pos[i];
    if (k > mid)
      return false;
    else {
      long long cha = mid - k;
      if (mid - k > k)
        cnt += k;
      else
        cnt += cha + (k - cha) * 2;
    }
    if (cnt > t) return false;
  }
  return cnt <= t;
}
int main() {
  cin >> n >> m >> s >> t;
  for (long long i = 0; i < n; i++) {
    scanf("%lld%lld", &ans1[i], &ans2[i]);
  }
  for (long long i = 0; i < m; i++) {
    scanf("%lld", &pos[i]);
  }
  pos[m] = 0, pos[m + 1] = s;
  sort(pos, pos + m + 2);
  long long ks = 0, js = 2e9;
  while (ks < js) {
    long long mid = (ks + js) >> 1;
    if (check(mid))
      js = mid;
    else
      ks = mid + 1;
  }
  long long min_ = 2e9;
  for (long long i = 0; i < n; i++)
    if (ans2[i] >= ks)
      if (ans1[i] < min_) min_ = ans1[i];
  if (min_ == (long long)2e9) min_ = -1;
  cout << min_ << endl;
  return 0;
}
