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 maxn = 200005;
int n, k, s, t, flag = 0;
struct node {
  int c, v;
  node(int c = 0, int v = 0) : c(c), v(v) {}
  bool operator<(const node &a) const { return v < a.v; }
};
node car[maxn];
int ki[maxn], del[maxn];
void init() {
  scanf("%d%d%d%d", &n, &k, &s, &t);
  for (int i = 1; i <= n; ++i) {
    int c, v;
    scanf("%d%d", &c, &v);
    car[i] = node(c, v);
  }
  for (int i = 1; i <= k; ++i) scanf("%d", &ki[i]);
  sort(ki + 1, ki + k + 1);
  del[0] = ki[1];
  for (int i = 1; i <= k - 1; ++i) del[i] = ki[i + 1] - ki[i];
  del[k] = s - ki[k];
}
bool check(int nw) {
  int l = car[nw].v, tim = 0;
  for (int i = 0; i <= k; ++i) {
    if (2 * del[i] <= l)
      tim += del[i];
    else if (del[i] > l / 2 && del[i] <= l)
      tim += (3 * del[i] - l);
    else
      return 0;
  }
  if (tim <= t) {
    flag = 1;
    return 1;
  } else
    return 0;
}
int py = 0;
node ys[maxn];
int main() {
  init();
  sort(car + 1, car + n + 1);
  int l = 1, r = n;
  while (l <= r) {
    int mid = (l + r) / 2;
    if (check(mid))
      r = mid - 1;
    else
      l = mid + 1;
  }
  int std = car[l].v;
  for (int i = 1; i <= n; ++i)
    if (car[i].v >= std) ys[++py] = car[i];
  if (!flag) {
    printf("-1");
    return 0;
  }
  int ans = 2147483647;
  for (int i = 1; i <= py; ++i) ans = min(ans, ys[i].c);
  printf("%d", ans);
  return 0;
}
