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;
int n, k;
long long s, t;
vector<pair<long long, long long>> a;
vector<long long> maxV;
vector<long long> g;
bool Check(const long long v) {
  long long ct = 0;
  long long pos = 0;
  for (int i = 0; i < (int)g.size(); ++i) {
    long long dist = g[i] - pos;
    if (dist > v) {
      return false;
    }
    long long v2 = (v - dist);
    v2 = min(v2, dist);
    long long v1 = dist - v2;
    ct += (v1 * 2 + v2);
    if (ct > t) {
      return false;
    }
    pos = g[i];
  }
  return true;
}
void Solve() {
  sort(g.begin(), g.end());
  g.push_back(s);
  sort(a.begin(), a.end());
  maxV.resize(n);
  maxV[0] = a[0].second;
  for (int i = 1; i < n; ++i) {
    maxV[i] = max(maxV[i - 1], a[i].second);
  }
  int bl = 0;
  int br = n - 1;
  int ba = -1;
  while (bl <= br) {
    int bm = (bl + br) >> 1;
    if (Check(maxV[bm])) {
      ba = bm;
      br = bm - 1;
    } else {
      bl = bm + 1;
    }
  }
  cout << (ba == -1 ? -1 : a[ba].first) << endl;
  exit(0);
}
bool Read() {
  if (!(cin >> n >> k >> s >> t)) {
    return false;
  }
  a.resize(n);
  for (int i = 0; i < n; ++i) {
    cin >> a[i].first >> a[i].second;
  }
  g.resize(k);
  for (int i = 0; i < k; ++i) {
    cin >> g[i];
  }
  return true;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  while (Read()) {
    Solve();
  }
  return 0;
}
