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 long long MOD = 1e9 + 7;
const int SIZE = 1e6 + 5;
const long long INF = 1LL << 60;
const double eps = 1e-4;
const double PI = 3.1415926535897932;
int x[200009];
pair<int, int> vv[200009];
vector<pair<int, int> > v;
int main() {
  int n, k;
  scanf("%d%d", &n, &k);
  int s, t;
  scanf("%d%d", &s, &t);
  for (int i = 0; i < (n); ++i) {
    scanf("%d%d", &(vv[i].first), &(vv[i].second));
  }
  sort(vv, vv + n);
  for (int i = 0; i < (n); ++i) {
    if (i == 0 || vv[i].second > v.back().second) {
      v.push_back(vv[i]);
    }
  }
  n = ((int)(v).size());
  for (int i = 0; i < (k); ++i) {
    scanf("%d", &(x[i]));
  }
  sort(x, x + k);
  x[k] = s;
  int st = 0, en = n;
  while (st < en) {
    int mi = (st + en) / 2;
    int ts = v[mi].second;
    long long mint = 0;
    for (int i = 0; i < (k + 1); ++i) {
      int rl = i ? x[i] - x[i - 1] : x[i];
      if (rl > ts) {
        mint = INF;
        break;
      }
      mint += max(2LL * (long long)rl - (long long)(ts - rl), (long long)rl);
    }
    if (mint <= t) {
      en = mi;
    } else {
      st = mi + 1;
    }
  }
  if (en == n)
    printf("-1");
  else
    printf("%d", v[st].first);
}
