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 = 1e6;
int n, k, s, t, pr[N + 2], cp[N + 2], gs[N + 2];
bool ok(int cc) {
  int tm = 0;
  for (int i = 1; i <= k; i++) {
    int ds = gs[i] - gs[i - 1];
    tm += ds * 2 - min(ds, cc - ds);
  }
  return tm <= t;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cin >> n >> k >> s >> t;
  for (int i = 1; i <= n; i++) cin >> pr[i] >> cp[i];
  for (int i = 1; i <= k; i++) cin >> gs[i];
  sort(gs + 1, gs + k + 1);
  int lo = 0, hi = 1e9, md;
  ++k;
  gs[k] = s;
  for (int i = 1; i <= k; i++) lo = max(lo, gs[i] - gs[i - 1]);
  while (hi - lo > 1) {
    md = (lo + hi) / 2;
    if (ok(md))
      hi = md;
    else
      lo = md;
  }
  for (md = lo; md <= hi; md++)
    if (ok(md)) break;
  int ans = 2e9;
  for (int i = 1; i <= n; i++) {
    if (cp[i] >= md) ans = min(ans, pr[i]);
  }
  if (ans > 1e9) ans = -1;
  cout << ans << endl;
  return 0;
}
