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 int mod = 1e9 + 7;
int n, k, t;
int a[200005];
long long trial(long long x) {
  long long ret = 0;
  for (int i = 0; i < k; i++) {
    if (a[i] > x) return 1e12;
    long long k = x - a[i];
    k = min(k, 1ll * a[i]);
    ret += 2 * a[i] - k;
  }
  return ret;
}
int main() {
  scanf("%d %d", &n, &k);
  scanf("%d %d", &a[k], &t);
  vector<pair<int, int> > v;
  for (int i = 0; i < n; i++) {
    int a, b;
    scanf("%d %d", &a, &b);
    v.push_back(pair<int, int>(a, b));
  }
  for (int i = 0; i < k; i++) scanf("%d", &a[i]);
  k++;
  sort(a, a + k);
  for (int i = k - 1; i; i--) a[i] -= a[i - 1];
  long long s = 0, e = 1e10;
  while (s != e) {
    long long m = (s + e) / 2;
    if (trial(m) <= t)
      e = m;
    else
      s = m + 1;
  }
  if (trial(s) > t) {
    puts("-1");
    return 0;
  }
  int ret = 2e9 + 22;
  for (auto &i : v) {
    if (i.second >= s) ret = min(ret, i.first);
  }
  if (ret > 2e9 + 2) {
    ret = -1;
  }
  cout << ret;
}
