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>
const int N = 200200;
using namespace std;
int n, k, s, t;
int c[N];
int v[N];
vector<int> g;
bool f(int x) {
  long long cnt = s + s;
  for (int i = 0; i + 1 < g.size(); i++) {
    if (g[i + 1] - g[i] > x) return false;
    int l = x - (g[i + 1] - g[i]);
    cnt -= min(g[i + 1] - g[i], l);
  }
  return cnt <= t;
}
int main() {
  ios_base::sync_with_stdio(0);
  scanf("%d%d%d%d", &n, &k, &s, &t);
  for (int i = 1; i <= n; i++) scanf("%d%d", &c[i], &v[i]);
  g.push_back(0);
  g.push_back(s);
  for (int i = 1; i <= k; i++) {
    int x;
    scanf("%d", &x);
    g.push_back(x);
  }
  sort(g.begin(), g.end());
  int l = 0, r = 1e9 + 1;
  while (l < r) {
    int m = (l + r) / 2;
    if (f(m))
      r = m;
    else
      l = m + 1;
  }
  int ans = 1e9 + 1;
  for (int i = 1; i <= n; i++)
    if (v[i] >= l) ans = min(ans, c[i]);
  if (ans == 1e9 + 1) ans = -1;
  printf("%d\n", ans);
}
