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;
long long N, K, s, t, c[200010], v[200010], g[200010];
bool check(long long fuel) {
  int i;
  long long time = 0;
  for (i = 1; i <= K; i++) {
    long long d = g[i] - g[i - 1];
    long long b = fuel - d;
    if (b < 0) return 0;
    b = min(b, d);
    time += 2 * (d - b) + b;
  }
  return time <= t;
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cin >> N >> K >> s >> t;
  int i;
  for (i = 1; i <= N; i++) cin >> c[i] >> v[i];
  for (i = 1; i <= K; i++) cin >> g[i];
  g[++K] = s;
  sort(g + 1, g + K + 1);
  long long l = 1, r = (1LL << 34), mid;
  while (l < r) {
    mid = (l + r) / 2;
    if (check(mid))
      r = mid;
    else
      l = mid + 1;
  }
  int ind = -1;
  for (i = 1; i <= N; i++)
    if (v[i] >= r) {
      if (ind == -1 || c[ind] > c[i]) ind = i;
    }
  if (ind == -1)
    cout << -1 << "\n";
  else
    cout << c[ind] << "\n";
  return 0;
}
