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 = 228228, INF = 1e9 + 228 + 666 + 1337;
int n, k, s, t;
int c[N], v[N], a[N];
bool can(int m) {
  int x = s;
  int i = k;
  int tim = 0;
  while (i >= 0 && x > 0) {
    int dist = x - a[i];
    if (m < dist) {
      return false;
    }
    int f = min(dist, m - dist);
    tim += (f + (dist - f) * 2);
    x = a[i];
    --i;
  }
  return tim <= t;
}
int main() {
  scanf("%d %d %d %d", &n, &k, &s, &t);
  for (int i = 0; i < n; ++i) {
    scanf("%d %d", &c[i], &v[i]);
  }
  vector<int> g(k);
  for (int i = 0; i < k; ++i) {
    scanf("%d", &g[i]);
  }
  sort(g.begin(), g.end());
  for (int i = 0; i < k; ++i) {
    a[i + 1] = g[i];
  }
  int l = 0, r = INF;
  while (r - l > 1) {
    int m = (l + r) / 2;
    if (can(m)) {
      r = m;
    } else {
      l = m;
    }
  }
  int vmin = r;
  int min_cost = INF;
  for (int i = 0; i < n; ++i) {
    if (v[i] >= vmin) {
      min_cost = min(min_cost, c[i]);
    }
  }
  if (min_cost == INF) {
    printf("-1\n");
    return 0;
  }
  printf("%d\n", min_cost);
  return 0;
}
