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;
bool Can(long long t, const vector<long long>& dists, long long cap) {
  if (cap < dists[dists.size() - 1]) {
    return false;
  }
  long long timetaken = 0;
  for (long long i = 0; i < dists.size(); ++i) {
    timetaken += max(dists[i], dists[i] * 3 - cap);
  }
  return timetaken <= t;
}
long long MinCap(long long t, const vector<long long>& dists) {
  long long LB = 0, UB = 1e9, result = LLONG_MAX;
  long long pos = (LB + UB) / 2;
  while (LB <= UB) {
    if (Can(t, dists, pos)) {
      result = pos;
      UB = pos - 1;
    } else {
      LB = pos + 1;
    }
    pos = (LB + UB) / 2;
  }
  return result;
}
int main() {
  ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
  long long n, k, s, t;
  cin >> n >> k >> s >> t;
  long long c[n], v[n];
  for (long long i = 0; i < n; ++i) {
    cin >> c[i] >> v[i];
  }
  vector<long long> gas(k);
  for (long long i = 0; i < k; ++i) {
    cin >> gas[i];
  }
  sort(gas.begin(), gas.end());
  vector<long long> dists(k + 1);
  dists[0] = gas[0];
  for (long long i = 1; i < k; ++i) {
    dists[i] = gas[i] - gas[i - 1];
  }
  dists[k] = s - gas[k - 1];
  sort(dists.begin(), dists.end());
  long long mincap = MinCap(t, dists);
  long long ans = LLONG_MAX;
  for (long long i = 0; i < n; ++i) {
    if (v[i] >= mincap && c[i] < ans) {
      ans = c[i];
    }
  }
  if (ans == LLONG_MAX) ans = -1;
  cout << ans << endl;
}
