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 main() {
  int n, k, s, t;
  scanf("%d%d%d%d", &n, &k, &s, &t);
  vector<pair<int, int> > car(n);
  vector<int> zp(k);
  for (long long i = 0; i < n; i++) {
    scanf("%d%d", &car[i].first, &car[i].second);
    cout << car[i].first << " " << car[i].second << "\n";
  }
  long long mlen = 0;
  for (long long i = 0; i < k; i++) {
    scanf("%d", &zp[i]);
    cout << zp[i] << "\n";
  }
  sort(zp.begin(), zp.end());
  for (long long i = 0; i < k; i++) {
    if (i == 0)
      mlen = max(mlen, long long(zp[i]));
    else
      mlen = max(mlen, long long(zp[i] - zp[i - 1]));
  }
  mlen = max(mlen, long long(s - zp[k - 1]));
  long long l = 0, r = mlen * 2 + 1;
  cout << mlen << "\n";
  while (r - l > 1) {
    long long m = (l + r) / 2;
    long long f = 1, time = 0;
    for (int i = 0; i < k; i++) {
      long long x, y;
      if (i == 0) {
        x = min(long long(zp[i]), m - long long(zp[i]));
        y = long long(zp[i]) - x;
      } else {
        x = min(long long(zp[i] - zp[i - 1]), m - long long(zp[i] - zp[i - 1]));
        y = long long(zp[i] - zp[i - 1]) - x;
      }
      if (x < 0 || y < 0) f = 0;
      time += y * 2 + x;
    }
    long long x, y;
    x = min(long long(s - zp[k - 1]), m - long long(s - zp[k - 1]));
    y = long long(s - zp[k - 1]) - x;
    if (x < 0 || y < 0) f = 0;
    time += y * 2 + x;
    if (time <= t && f == 1)
      r = m;
    else
      l = m;
  }
  if (r == mlen * 2 + 1) {
    printf("%d", -1);
    return 0;
  }
  int ans = 2000000001;
  for (int i = 0; i < n; i++) {
    if (long long(car[i].second) >= r) ans = min(ans, car[i].first);
  }
  if (ans == 2000000001)
    printf("%d", -1);
  else
    printf("%d", ans);
  return 0;
}
