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 n, k, s, t;
bool can(int c, vector<int> st) {
  long long ans = 0;
  for (int i = 1; i < (int)st.size(); i++) {
    int gap = st[i] - st[i - 1];
    if (gap > c) return false;
    if (c >= 2 * gap)
      ans += gap;
    else
      ans += 1LL * 3 * gap - c;
  }
  return ans <= t;
}
int main() {
  scanf("%d %d %d %d", &n, &k, &s, &t);
  vector<pair<int, int> > cars(n);
  for (int i = 0; i < n; i++) scanf("%d %d", &cars[i].second, &cars[i].first);
  vector<int> st(k + 2);
  int dist = 0;
  st[0] = 0;
  st[k + 1] = s;
  for (int i = 1; i <= k; i++) cin >> st[i];
  sort(st.begin(), st.end());
  sort(cars.begin(), cars.end());
  int low = 0, high = n;
  int ans = -1;
  while (high > low) {
    int mid = (high + low) / 2;
    if (can(cars[mid].first, st)) {
      ans = mid;
      high = mid;
    } else
      low = mid + 1;
  }
  if (ans == -1) {
    cout << -1;
    return 0;
  }
  int pr = 2000000000;
  for (int i = 0; i < n; i++)
    if (cars[i].first >= cars[ans].first) pr = min(pr, cars[i].second);
  printf("%d", pr);
  return 0;
}
