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;
const int N = 200000 + 1;
long long g[N];
int car[N][2];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  int n, k, s, t;
  cin >> n >> k >> s >> t;
  for (int i = 0; i < n; ++i) {
    for (int j = 0; j < 2; ++j) {
      cin >> car[i][j];
    }
  }
  for (int i = 0; i < k; ++i) {
    cin >> g[i];
  }
  sort(g, g + k);
  g[k] = s - g[k - 1];
  for (int i = k - 1; i > 0; --i) {
    g[i] -= g[i - 1];
  }
  int lo = *max_element(g, g + k + 1);
  int hi = INT_MAX;
  while (lo < hi) {
    int v = lo + (hi - lo) / 2;
    long long need = 0;
    for (int i = 0; i <= k; ++i) {
      need += max(g[i], 3 * g[i] - v);
    }
    if (need <= t) {
      hi = v;
    } else {
      lo = v + 1;
    }
  }
  int ans = INT_MAX;
  for (int i = 0; i < n; ++i) {
    if (car[i][1] >= lo) {
      ans = min(ans, car[i][0]);
    }
  }
  cout << (ans == INT_MAX ? -1 : ans) << "\n";
}
