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;
long long n, k, s, t;
long long ans = 1e15 + 1;
vector<pair<long long, long long> > car;
long long g[200010];
bool check(long long f) {
  long long T = 0;
  for (int i = 1; i <= k; i++) {
    long long delta = g[i] - g[i - 1];
    long long a = max(0 * 1LL, 2 * delta - f);
    long long b = delta - a;
    if (b < 0) return false;
    T += 2 * a + b;
  }
  if (T <= t) return true;
  return false;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cin >> n >> k >> s >> t;
  for (int i = 1; i <= n; i++) {
    long long c, v;
    cin >> c >> v;
    car.push_back(pair<long long, long long>(c, v));
  }
  for (int i = 1; i <= k; i++) cin >> g[i];
  g[++k] = s;
  sort(g + 1, g + k + 1);
  int l = 0, r = s + 1, mid;
  while (r - l > 1) {
    mid = (l + r) / 2;
    if (check(mid))
      r = mid;
    else
      l = mid;
  }
  for (int i = 0; i < n; i++) {
    if (car[i].second >= r) {
      ans = min(ans, car[i].first);
    }
  }
  if (ans == 1e15 + 1)
    cout << -1;
  else
    cout << ans << "\n";
}
