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;
inline int setBit(int N, int pos) { return N = N | (1 << pos); }
inline int resetBit(int N, int pos) { return N = N & ~(1 << pos); }
inline bool checkBit(int N, int pos) { return (bool)(N & (1 << pos)); }
int n, k;
long long s, T, P[200000 + 10];
pair<long long, long long> A[200000 + 10];
bool cmp(pair<long long, long long> a, pair<long long, long long> b) {
  return a.second < b.second;
}
bool ok(long long c) {
  long long ret = 0;
  for (int i = 1; i <= k + 1; i++) {
    long long x = P[i] - P[i - 1];
    if (x > c) return false;
    if (c / 2 >= x)
      ret += x;
    else {
      ret += (c - x) + 2 * (2 * x - c);
    }
  }
  return ret <= T;
}
int main() {
  int i, j, cs;
  scanf("%d %d", &n, &k);
  scanf("%lld %lld", &s, &T);
  for (i = 1; i <= n; i++) scanf("%lld %lld", &A[i].first, &A[i].second);
  for (i = 1; i <= k; i++) scanf("%lld", &P[i]);
  sort(A + 1, A + n + 1, cmp);
  sort(P + 1, P + k + 1);
  P[k + 1] = s;
  int lo = 1, hi = n, mid;
  while (lo < hi) {
    mid = (lo + hi) / 2;
    if (ok(A[mid].second))
      hi = mid;
    else
      lo = mid + 1;
  }
  if (!ok(A[lo].second))
    printf("-1\n");
  else {
    long long ret = A[hi].first;
    for (int i = hi; i <= n; i++) ret = min(A[i].first, ret);
    printf("%lld\n", ret);
  }
  return 0;
}
