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 INF = 1 << 30;
const int N = 2e5 + 10;
pair<int, int> a[N];
int g[N];
int n, m, s, t;
bool check(int cap) {
  long long sum = 0;
  for (int i = 1; i < m; ++i) {
    int dis = g[i] - g[i - 1];
    if (dis > cap) return false;
    if (dis * 2 <= cap) {
      sum += dis;
    } else {
      int x = cap - dis;
      int y = dis - x;
      sum += x + 2LL * y;
    }
  }
  return sum <= t;
}
int main() {
  scanf("%d%d%d%d", &n, &m, &s, &t);
  for (int i = 0; i < n; ++i) {
    scanf("%d%d", &a[i].first, &a[i].second);
  }
  sort(a, a + n);
  for (int i = 1; i < n; ++i) {
    a[i].second = max(a[i].second, a[i - 1].second);
  }
  g[0] = 0;
  for (int i = 1; i <= m; ++i) {
    scanf("%d", g + i);
  }
  sort(g + 1, g + m + 1);
  g[m + 1] = s;
  m += 2;
  int low = 0, high = n;
  while (low != high) {
    int mid = (low + high) / 2;
    if (check(a[mid].second)) {
      high = mid;
    } else {
      low = mid + 1;
    }
  }
  int ret = high == n ? -1 : a[high].first;
  printf("%d\n", ret);
  return 0;
}
