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 int inf = 1e15;
const long long int mod = 1000000007;
const int infInt = 1e9;
const double PI = acos(-1.00);
const double eps = 1e-6;
long long int nCars, nGas, len, Time;
pair<long long int, long long int> cars[200010];
long long int stations[200010];
long long int bb(long long int ini, long long int fin, long long int fuel) {
  long long int ans = -1;
  long long int dist = fin;
  while (ini <= fin) {
    long long int mid = (ini + fin) / 2;
    if (2LL * mid + (dist - mid) <= fuel) {
      ans = mid;
      ini = mid + 1;
    } else {
      fin = mid - 1;
    }
  }
  return ans;
}
bool can(long long int fuel) {
  long long int timeSpend = 0;
  long long int ant = 0;
  for (int i = 0; i < nGas; i++) {
    long long int dist = stations[i] - ant;
    ant = stations[i];
    if (2LL * dist <= fuel) {
      timeSpend += dist;
      continue;
    }
    if (dist > fuel) return false;
    long long int bestAcc = bb(0, dist, fuel);
    timeSpend += bestAcc + 2 * (dist - bestAcc);
  }
  return (timeSpend <= Time);
}
int main() {
  cin.sync_with_stdio(false);
  cin.tie(NULL);
  long long int maxi = -inf;
  cin >> nCars >> nGas >> len >> Time;
  for (int i = 0; i < nCars; i++) {
    cin >> cars[i].first >> cars[i].second;
    maxi = max(maxi, cars[i].second);
  }
  for (int i = 0; i < nGas; i++) {
    cin >> stations[i];
  }
  sort(stations, stations + nGas);
  stations[nGas++] = len;
  long long int ini = 0, fin = maxi;
  long long int bestFuel = -1;
  while (ini <= fin) {
    long long int mid = (ini + fin) / 2;
    if (can(mid)) {
      bestFuel = mid;
      fin = mid - 1;
    } else {
      ini = mid + 1;
    }
  }
  if (bestFuel == -1)
    cout << -1 << "\n";
  else {
    long long int best = inf;
    for (int i = 0; i < nCars; i++) {
      if (cars[i].second >= bestFuel) {
        best = min(best, cars[i].first);
      }
    }
    cout << best << "\n";
  }
}
