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 = 3e5 + 10;
const int INF = 2e9 + 7;
int n, m, s, t, g[MAXN];
pair<int, int> vec[MAXN];
int get(int f) {
  int ret = 0;
  for (int i = 0; ret < INF && i + 1 < m; i++) {
    int dis = g[i + 1] - g[i];
    if (dis > f) return INF;
    ret += dis << 1;
    int z = min(dis, f - dis);
    ret -= z;
  }
  return ret;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cin >> n >> m >> s >> t;
  for (int i = 0; i < n; i++) cin >> vec[i].first >> vec[i].second;
  for (int i = 0; i < m; i++) cin >> g[i];
  g[m++] = 0;
  g[m++] = s;
  sort(g, g + m);
  int b = 1, e = 1e9, ret = 2e9;
  while (b <= e) {
    int mid = b + e >> 1, mx = 0;
    for (int i = 0; i < n; i++)
      if (vec[i].first <= mid) mx = max(mx, vec[i].second);
    if (get(mx) <= t)
      ret = mid, e = mid - 1;
    else
      b = mid + 1;
  }
  if (ret > 1e9 + 7) ret = -1;
  cout << ret << "\n";
  return 0;
}
