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 int N = 2e5 + 10;
int c[N], v[N];
int g[N];
int n, k, s, t;
bool check(int v) {
  long long cnt = 0;
  for (int i = 1; i <= k + 1; i++) {
    int len = g[i] - g[i - 1];
    if (len > v) return false;
    int tmp = v - len;
    if (tmp <= len)
      cnt += tmp + (len - tmp) * 2;
    else
      cnt += len;
  }
  if (cnt <= t)
    return true;
  else
    return false;
}
int main() {
  scanf("%d%d%d%d", &n, &k, &s, &t);
  for (int i = 1; i <= n; i++) scanf("%d%d", c + i, v + i);
  for (int i = 1; i <= k; i++) scanf("%d", g + i);
  sort(g + 1, g + k + 1);
  g[0] = 0;
  g[k + 1] = s;
  int l = 0, r = 1e9;
  if (!check(r))
    puts("-1");
  else {
    while (l + 1 < r) {
      int mid = (l + r) >> 1;
      if (check(mid))
        r = mid;
      else
        l = mid;
    }
    int ans = 2e9;
    for (int i = 1; i <= n; i++)
      if (v[i] >= r) ans = min(ans, c[i]);
    if (ans == 2e9)
      puts("-1");
    else
      printf("%d\n", ans);
  }
  return 0;
}
