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 n, k, s, t, sol, i, crt, p;
int v[200003], c[200003], g[200003], sum[200003];
int main() {
  scanf("%d %d %d %d", &n, &k, &s, &t);
  for (i = 1; i <= n; i++) scanf("%d %d", &c[i], &v[i]);
  for (i = 1; i <= k; i++) scanf("%d", &g[i]);
  sort(g + 1, g + k + 1);
  k++;
  g[k] = s;
  for (i = k; i >= 1; i--) g[i] -= g[i - 1];
  sort(g + 1, g + k + 1);
  for (i = 1; i <= k; i++) sum[i] = sum[i - 1] + g[i];
  sol = 2000000005;
  for (i = 1; i <= n; ++i) {
    if (v[i] < g[k]) continue;
    p = upper_bound(g + 1, g + k + 1, v[i] / 2) - g;
    int total = (k - p + 1) * v[i], acc = total - (sum[k] - sum[p - 1]);
    crt = sum[p - 1] + acc + 2 * (sum[k] - sum[p - 1] - acc);
    if (crt <= t)
      if (c[i] < sol) sol = c[i];
  }
  if (sol == 2000000005)
    printf("-1\n");
  else
    printf("%d\n", sol);
  return 0;
}
