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 INF = 2e9 + 1, t, k;
int b[200020];
int cal(int dis, int cap) {
  if (dis > cap) return INF;
  if (dis == cap) return 2 * cap;
  if (dis * 2 <= cap) return dis;
  return dis * 2 - (cap - dis);
}
bool ch(int x) {
  long long int ans = 0;
  for (int i = 1; i < k; i++) {
    ans += cal(b[i + 1] - b[i], x);
  }
  if (ans <= t) return true;
  return false;
}
pair<int, int> a[200010];
int main() {
  int n, s, imin = INF;
  scanf("%d %d %d %d", &n, &k, &s, &t);
  for (int i = 1; i <= n; i++) {
    scanf("%d %d", &a[i].second, &a[i].first);
  }
  for (int i = 1; i <= k; i++) {
    scanf("%d", &b[i]);
  }
  k += 2;
  b[k - 1] = 0;
  b[k] = s;
  sort(b + 1, b + 1 + k);
  int l = 1, r = 1e9 + 20;
  while (l < r) {
    int mid = (l + r) / 2;
    if (ch(mid))
      r = mid;
    else
      l = mid + 1;
  }
  for (int i = 1; i <= n; i++) {
    if (l <= a[i].first) imin = min(imin, a[i].second);
  }
  cout << (imin == INF ? -1 : imin);
}
