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 greedy(int L, int F) {
  if (F < L) return -1;
  int l1 = min(L, F - L);
  int l2 = L - l1;
  return l1 + l2 * 2;
};
vector<int> g;
bool go(int T, int V) {
  int it = 0;
  int ret = 0;
  for (int x : g) {
    int q = greedy(x - it, V);
    if (q < 0) return false;
    ret += q;
    it = x;
  }
  return ret <= T;
}
int U[222222], V[222222];
int main() {
  int N, K, S, T;
  scanf("%d%d%d%d", &N, &K, &S, &T);
  for (int i = 0; i < N; i++) scanf("%d%d", U + i, V + i);
  for (int i = 0; i < K; i++) {
    int x;
    scanf("%d", &x);
    g.push_back(x);
  }
  sort(g.begin(), g.end());
  g.push_back(S);
  int lo = 1, hi = 1e9 + 1;
  while (lo < hi) {
    int mid = (lo + hi) / 2;
    if (go(T, mid))
      hi = mid;
    else
      lo = mid + 1;
  }
  int id = -1;
  for (int i = 0; i < N; i++) {
    if (V[i] >= lo) {
      if (id == -1 || U[i] < U[id]) id = i;
    }
  }
  if (id == -1)
    printf("-1");
  else
    printf("%d", U[id]);
}
