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 inf = 1e18;
int main() {
  std::ios::sync_with_stdio(false);
  long long n, k, s, t;
  scanf("%lld %lld %lld %lld", &n, &k, &s, &t);
  std::vector<long long> shit(n), shit2(n);
  for (int i = 0; i < n; ++i) {
    scanf("%lld", &shit[i]);
    scanf("%lld", &shit2[i]);
  }
  std::vector<long long> g(k);
  for (int i = 0; i < k; ++i) scanf("%lld", &g[i]);
  g.push_back(0);
  sort(g.begin(), g.end());
  g.push_back(s);
  long long answ = inf;
  long long l = 0, r = inf;
  while (r - l > 1) {
    long long v = (l + r) / 2;
    long long curVR = 0;
    for (int j = 0; j < k + 1; ++j) {
      long long dist = abs(g[j] - g[j + 1]);
      if (dist > v) {
        curVR = inf;
        break;
      }
      if (dist > v / 2) {
        curVR += 3 * dist - v;
      } else {
        curVR += dist;
      }
    }
    if (curVR > t) {
      l = v;
    }
    if (curVR <= t) {
      r = v;
    }
  }
  for (int i = 0; i < n; ++i) {
    if (shit2[i] >= r) {
      answ = std::min(answ, shit[i]);
    }
  }
  if (answ == inf)
    std::cout << -1;
  else
    std::cout << answ;
}
