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 = (long long)1e18;
vector<long long> g;
long long go(long long x) {
  long long res = 0;
  for (int i = 1; i < g.size(); i++) {
    long long len = g[i] - g[i - 1];
    if (len > x) return INF;
    long long slow = max(0ll, 2 * len - x);
    res += len + slow;
  }
  return res;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(nullptr);
  long long n, s, t, k;
  cin >> n >> k >> s >> t;
  vector<long long> c(n);
  vector<long long> v(n);
  for (int i = 0; i < n; i++) cin >> c[i] >> v[i];
  g = {0, s};
  for (int i = 0; i < k; i++) {
    long long x;
    cin >> x;
    g.push_back(x);
  }
  long long lo = 0;
  long long hi = INF;
  sort(g.begin(), g.end());
  long long res = INF;
  while (hi - lo > 1) {
    long long mid = (lo + hi) / 2;
    if (go(mid) <= t)
      hi = mid;
    else
      lo = mid;
  }
  for (int i = 0; i < n; i++) {
    if (v[i] >= hi) res = min(res, c[i]);
  }
  if (res == INF) res = -1;
  cout << res << endl;
}
