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 long long mod = 1000000007;
int main() {
  int n, k, s, t;
  scanf("%d %d %d %d", &n, &k, &s, &t);
  if (t < s) {
    cout << -1;
    return 0;
  }
  std::vector<std::pair<int, int> > var(n);
  for (int i = 0; i < n; i++) {
    scanf("%d %d", &var[i].first, &var[i].second);
  }
  std::vector<int> g(k);
  for (int i = 0; i < k; i++) {
    scanf("%d", &g[i]);
  }
  g.push_back(0);
  g.push_back(s);
  sort((g).begin(), (g).end());
  std::vector<int> d;
  for (int i = 0; i < k + 1; i++) {
    d.push_back(g[i + 1] - g[i]);
  }
  sort((d).begin(), (d).end());
  long long l = 0;
  long long r = 2000000000;
  while (r - l > 1) {
    long long m = (r + l) / 2;
    long long cur = 0;
    for (long long x : d) {
      if (x > m)
        cur = t + 1;
      else {
        cur += 2 * x - min(m - x, x);
      }
    }
    if (cur <= t)
      r = m;
    else
      l = m;
  }
  int ans = 1000000001;
  for (auto x : var) {
    if (x.second >= r) ans = min(x.first, ans);
  }
  if (ans == 1000000001) ans = -1;
  cout << ans;
}
