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 N = 2 * 1e5 + 100;
long long n, k, s, t, c[N], v[N], g[N], d[N], sum[N];
inline long long read() {
  long long f = 1, x = 0;
  char s = getchar();
  while (s < '0' || s > '9') {
    if (s == '-') f = -1;
    s = getchar();
  }
  while (s >= '0' && s <= '9') {
    x = x * 10 + s - '0';
    s = getchar();
  }
  return x * f;
}
signed main() {
  n = read();
  k = read();
  s = read();
  t = read();
  for (long long i = 1; i <= n; i++) c[i] = read(), v[i] = read();
  for (long long i = 1; i <= k; i++) g[i] = read();
  sort(g + 1, g + 1 + k);
  for (long long i = 1; i <= k; i++) d[i] = g[i] - g[i - 1];
  d[k + 1] = s - g[k];
  k++;
  sort(d + 1, d + 1 + k);
  for (long long i = 1; i <= k; i++) sum[i] = sum[i - 1] + d[i];
  if (t < s) {
    printf("-1\n");
    return 0;
  }
  long long MIN = 0x3f3f3f3f;
  for (long long i = 1; i <= n; i++) {
    if (v[i] < d[k]) continue;
    long long pos = upper_bound(d + 1, d + 1 + k, v[i] / 2) - d - 1;
    long long all = sum[pos] + (sum[k] - sum[pos]) * 3 - (k - pos) * v[i];
    if (all <= t) MIN = min(MIN, c[i]);
  }
  if (MIN == 0x3f3f3f3f)
    printf("-1\n");
  else
    printf("%lld\n", MIN);
}
