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;
template <typename t>
t read() {
  t x = 0;
  int f = 1, c = getchar();
  while (c > '9' || c < '0') f = c == '-' ? -1 : 1, c = getchar();
  while (c >= '0' && c <= '9') x = x * 10 + c - 48, c = getchar();
  return x * f;
}
template <typename t>
void write(t x) {
  if (x < 0) {
    putchar('-'), write(-x);
    return;
  }
  if (x >= 10) write(x / 10);
  putchar(x % 10 + 48);
}
const int maxn = 2e5 + 10;
const int maxv = 1e9 + 10;
struct Car {
  int c, v;
} car[maxn];
int n, k, s, t, g[maxn], mxg, mxv, ans;
bool jud(int x) {
  if (x < mxg) return 0;
  int tot = 0;
  for (int i = 1; i <= k + 1; i++) {
    tot += max(g[i] * 3 - x, g[i]);
    if (tot > t) return 0;
  }
  return 1;
}
int main() {
  n = read<int>(), k = read<int>(), s = read<int>(), t = read<int>();
  for (int i = 1; i <= n; i++) car[i].c = read<int>(), car[i].v = read<int>();
  for (int i = 1; i <= k; i++) g[i] = read<int>();
  sort(g + 1, g + k + 1);
  g[k + 1] = s;
  for (int i = k + 1; i >= 1; i--) mxg = max(mxg, g[i] -= g[i - 1]);
  mxv = maxv;
  for (int l = 0, r = maxv, m; l <= r;
       jud(m = l + r >> 1) ? r = m - 1, mxv = m : l = m + 1)
    ;
  ans = maxv;
  for (int i = 1; i <= n; i++)
    if (car[i].v >= mxv) ans = min(ans, car[i].c);
  ans = (ans == maxv || mxv == maxv) ? -1 : ans;
  write(ans);
  return 0;
}
