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 void in(int &a) { scanf("%d", &a); }
const int MAX = 2e5 + 5;
pair<int, int> cars[MAX];
int gas[MAX];
int n, k, s, t;
bool check(int fuelTank, int time) {
  int currTime = 0;
  for (int i = 1; i < k + 2; i++) {
    int now = gas[i] - gas[i - 1];
    if (fuelTank < now) return false;
    int a = fuelTank - now;
    int b = 2 * now - fuelTank;
    if (b < 0) {
      a = now;
      b = 0;
    }
    currTime += a + 2 * b;
  }
  return currTime <= time;
}
int main() {
  scanf("%d %d %d %d", &n, &k, &s, &t);
  for (int i = 0; i < n; i++) scanf("%d %d", &cars[i].first, &cars[i].second);
  for (int i = 1; i < k + 1; i++) scanf("%d", &gas[i]);
  sort(gas + 1, gas + k + 1);
  gas[k + 1] = s;
  if (t < s) {
    puts("-1");
    return 0;
  }
  int left = 0, right = s, curr, ans = 3 * s - t;
  while (left <= right) {
    curr = (left + right) >> 1;
    if (check(curr, t)) {
      ans = curr;
      right = curr - 1;
    } else {
      left = curr + 1;
    }
  }
  int mn = INT32_MAX;
  for (int i = 0; i < n; i++) {
    if (cars[i].second >= ans) {
      mn = min(mn, cars[i].first);
    }
  }
  puts(mn == INT32_MAX ? "-1" : to_string(mn).c_str());
  return 0;
}
