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 std::cin;
using std::cout;
using std::deque;
using std::endl;
using std::map;
using std::max;
using std::min;
using std::multiset;
using std::pair;
using std::queue;
using std::set;
using std::sort;
using std::stack;
using std::string;
using std::vector;
int n, k, s, t;
int c[200005] = {
    0,
};
int v[200005] = {
    0,
};
int g[200005] = {
    0,
};
bool isGood(int middle) {
  int time = 0;
  for (int i = 1; i <= k + 1; i++) {
    int len = g[i] - g[i - 1];
    if (len > middle) {
      return false;
    }
    if (middle >= len * 2) {
      time += len;
    } else {
      time += (len * 2 - middle) * 2 + (middle - len);
    }
  }
  if (time <= t) return true;
  return false;
}
int main() {
  cin >> n >> k >> s >> t;
  for (int i = 0; i < n; i++) {
    scanf("%d%d", c + i, v + i);
  }
  g[0] = 0;
  g[k + 1] = s;
  for (int i = 1; i <= k; i++) {
    scanf("%d", g + i);
  }
  sort(g, g + k + 2);
  const int up = 2123456789;
  int badBak = 0;
  int goodBak = up;
  while (badBak + 1 != goodBak) {
    int middle = (int)((1LL * badBak + goodBak) / 2);
    if (isGood(middle)) {
      goodBak = middle;
    } else {
      badBak = middle;
    }
  }
  if (goodBak == up) {
    cout << -1;
    return 0;
  }
  int cheap = up;
  for (int i = 0; i < n; i++) {
    if (v[i] >= goodBak && c[i] < cheap) {
      cheap = c[i];
    }
  }
  if (cheap == up) {
    cout << -1;
    return 0;
  }
  cout << cheap;
  return 0;
}
