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 k;
long long c[200100];
long long b[200100];
long long aw[200100];
long long i, n, s, t, answer, d;
long long check(long long v, long long ti) {
  long long t, i, a, d;
  t = 0;
  for (i = 1; i <= k; i++) {
    d = aw[i] - aw[i - 1];
    if (d > v) {
      return 0;
    }
    if (d * 2 <= v) {
      t += d;
    } else {
      a = (2 * d) - v;
      t += (2 * a) + (d - a);
    }
    if (t > ti) return 0;
  }
  return 1;
}
int main() {
  ios_base::sync_with_stdio(false);
  ios_base::sync_with_stdio(false);
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cin.tie(NULL);
  cout.tie(NULL);
  cout.tie(NULL);
  cout.tie(NULL);
  cin >> n >> k >> s >> t;
  for (i = 1; i <= n; i++) {
    cin >> c[i] >> b[i];
  }
  for (i = 1; i <= k; i++) {
    cin >> aw[i];
  }
  ios_base::sync_with_stdio(false);
  k++;
  aw[k] = s;
  sort(aw + 1, aw + 1 + k);
  long long l = 1;
  long long r = 3ll * s;
  while (l + 1 < r) {
    long long mid = (l + r) / 2;
    if (check(mid, t) == 0)
      l = mid;
    else
      r = mid;
  }
  d = -1;
  if (check(l, t) == 1)
    d = l;
  else if (check(r, t) == 1)
    d = r;
  if (d == -1)
    cout << "-1";
  else {
    answer = -1;
    for (i = 1; i <= n; i++) {
      if (b[i] >= d) {
        if ((answer == -1) || (answer > c[i])) answer = c[i];
      }
    }
    cout << answer;
  }
  return 0;
}
