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, len, tim, i, k, dis[200020];
pair<long long, long long> a[200020];
inline bool solve(long long cap) {
  long long i, ans = 0;
  for (i = 1; i <= k; i++) {
    long long dist = dis[i] - dis[i - 1];
    if (dist > cap) return false;
    long long slow = dist;
    long long fastt = min(slow, cap - slow);
    slow -= fastt;
    ans += (2 * slow) + fastt;
  }
  if (ans <= tim) return true;
  return false;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cin >> n >> k >> len >> tim;
  for (i = 1; i <= n; i++) {
    cin >> a[i].first;
    cin >> a[i].second;
  }
  for (i = 1; i <= k; i++) {
    cin >> dis[i];
  }
  sort(dis + 1, dis + k + 1);
  k++;
  dis[k] = len;
  long long low = 1, high = 9999999999;
  long long best_time = 99999999999;
  while (low <= high) {
    long long mid = (low + high) / 2;
    if (solve(mid)) {
      best_time = min(best_time, mid);
      high = mid - 1;
    } else
      low = mid + 1;
  }
  if (best_time == 99999999999) {
    cout << "-1";
    return 0;
  }
  long long ans = 99999999999;
  for (i = 1; i <= n; i++) {
    if (a[i].second >= best_time) {
      ans = min(ans, a[i].first);
    }
  }
  if (ans == 99999999999) {
    cout << -1;
    return 0;
  }
  cout << ans;
}
