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;
struct node {
  int p, v;
} c[200005];
int a[200005];
int n, k, s, t;
int cmp(node x, node y) {
  if (x.v == y.v) return x.p < y.p;
  return x.v < y.v;
}
int make(int rode, int x) {
  if (rode > x) return 0;
  if (x >= rode * 2) return rode;
  int ans = x - rode;
  return ans + (rode - ans) * 2;
}
int vj(int mid) {
  int time = 0;
  int now = 0;
  for (int i = 0; i < k; i++) {
    int fl = make(a[i] - now, mid);
    now = a[i];
    if (fl)
      time += fl;
    else
      return 0;
  }
  if (time <= t) return 1;
  return 0;
}
int main() {
  cin >> n >> k >> s >> t;
  for (int i = 0; i < n; i++) scanf("%d%d", &c[i].p, &c[i].v);
  for (int i = 0; i < k; i++) scanf("%d", a + i);
  a[k++] = s;
  sort(a, a + k);
  int r = 1000000000, l = 0;
  while (l <= r) {
    int mid = (l + r) / 2;
    if (vj(mid)) {
      r = mid - 1;
    } else
      l = mid + 1;
  }
  r++;
  sort(c, c + n, cmp);
  int minn = 1000000009;
  for (int i = 0; i < n; i++) {
    if (c[i].v >= l) {
      if (c[i].p < minn) minn = c[i].p;
    }
  }
  if (minn == 1000000009)
    cout << -1 << endl;
  else
    cout << minn << endl;
  return 0;
}
