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 = 4e18;
const long long N = 2e5 + 10;
void testCase() {
  long long n, k, s, t;
  cin >> n >> k >> s >> t;
  vector<long long> cost(n), cap(n), f(k);
  for (long long i = 0; i < n; i++) cin >> cost[i] >> cap[i];
  for (long long &i : f) cin >> i;
  f.push_back(0);
  f.push_back(s);
  sort(begin(f), end(f));
  auto isPos = [&](long long lim) {
    long long totslow = t - s;
    for (long long i = 1; i <= k + 1; i++) {
      long long diff = f[i] - f[i - 1];
      long long fast = lim - diff;
      if (fast < 0) return false;
      long long slow = max(0ll, diff - fast);
      totslow -= slow;
      if (totslow < 0) return false;
    }
    return true;
  };
  long long mi = 0, ma = inf;
  while (mi + 1 < ma) {
    long long mid = (mi + ma) / 2;
    if (isPos(mid))
      ma = mid;
    else
      mi = mid;
  }
  long long ans = inf;
  for (long long i = 0; i < n; i++) {
    if (cap[i] >= ma) ans = min(ans, cost[i]);
  }
  cout << (ans == inf ? -1 : ans) << '\n';
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr), cout.tie(nullptr);
  long long t_c = 1;
  while (t_c--) testCase();
}
