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 main() {
  int n, k, s, t;
  cin >> n >> k >> s >> t;
  vector<int> c(n);
  vector<int> v(n);
  for (int i = 0; i < n; i++) scanf("%d%d", &c[i], &v[i]);
  vector<int> g(k + 2);
  for (int i = 0; i < k; i++) scanf("%d", &g[i]);
  g[k] = 0;
  g[k + 1] = s;
  k += 2;
  sort(g.begin(), g.end());
  int q = 2e9;
  int start = 0;
  int end = 2e9;
  int mid = 2e9 / 2;
  for (int i = 0; i <= 32 && start < end; i++) {
    bool flag = true;
    int y = 0;
    for (int j = 1; j < k && flag; j++)
      if (g[j] - g[j - 1] > mid)
        flag = false;
      else
        y +=
            min(g[j] - g[j - 1], mid - g[j] + g[j - 1]) +
            2 * (g[j] - g[j - 1] - min(g[j] - g[j - 1], mid - g[j] + g[j - 1]));
    if (flag && y <= t) {
      end = mid;
      mid = (end + start) / 2;
      q = end;
    } else {
      start = mid;
      mid = (end + start) / 2;
    }
  }
  int min1 = 2e9 + 1;
  for (int i = 0; i < n; i++)
    if (v[i] >= q && c[i] < min1) min1 = c[i];
  if (min1 == 2e9 + 1)
    cout << "-1";
  else
    cout << min1;
  return 0;
}
