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 = 1 << 18;
int n, k, s, t, c[N], v[N], p[N];
bool judge(int c) {
  int sum = 0;
  for (int i = 1; i <= k; i++) {
    int d = p[i] - p[i - 1];
    if (d > c) return 0;
    sum += d + max(d + d - c, 0);
  }
  return sum <= t;
}
int main() {
  cin >> n >> k >> s >> t;
  for (int i = 1; i <= n; i++) scanf("%d%d", v + i, c + i);
  for (int i = 1; i <= k; i++) scanf("%d", p + i);
  p[++k] = s, sort(p + 1, p + k + 1);
  int L = 1, R = 1 << 30;
  for (; L < R;) {
    int mid = (L + R) >> 1;
    if (judge(mid))
      R = mid;
    else
      L = mid + 1;
  }
  if (!judge(L))
    puts("-1");
  else {
    int res = (1 << 30);
    for (int i = 1; i <= n; i++)
      if (c[i] >= L) res = min(res, v[i]);
    if (res == 1 << 30)
      puts("-1");
    else
      cout << res << endl;
  }
}
