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;
bool check(int x, int t, int n, vector<int>& g) {
  int u = 0;
  for (int i = 0; i <= n; i++) {
    int d = g[i + 1] - g[i];
    if (x < d) return false;
    u += d * 2 - min(d, x - d);
    if (t < u) return false;
  }
  return true;
}
int main() {
  int n, m, s, t, ans = -1;
  scanf("%d%d%d%d", &n, &m, &s, &t);
  vector<pair<int, int> > second(n);
  vector<int> g(m);
  for (int i = 0; i < n; i++)
    scanf("%d%d", &second[i].first, &second[i].second);
  for (int i = 0; i < m; i++) scanf("%d", &g[i]);
  g.push_back(0);
  g.push_back(s);
  sort(g.begin(), g.end());
  sort(second.begin(), second.end());
  for (int i = 1; i < n; i++)
    second[i].second = max(second[i].second, second[i - 1].second);
  for (int l = 0, r = n; l < r;) {
    int k = (l + r) >> 1;
    if (!check(second[k].second, t, m, g))
      l = k + 1;
    else {
      ans = second[k].first;
      r = k;
    }
  }
  printf("%d\n", ans);
}
