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 N = 2e5 + 10;
long long n, k, s, t, c[N], v[N], x[N];
bool check(long long V) {
  int last = 0;
  long double T = 0;
  for (int i = 0; i < k; i++) {
    long double d = x[i] - last;
    if (V < d) return false;
    long double big = min(V - d, d);
    T += big;
    T += 2 * (d - big);
    last = x[i];
  }
  if (T <= t)
    return true;
  else
    return false;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cin >> n >> k >> s >> t;
  for (int i = 0; i < n; i++) cin >> c[i] >> v[i];
  for (int i = 0; i < k; i++) cin >> x[i];
  x[k++] = s;
  sort(x, x + k);
  int l = 0, r = 1e9 + 10;
  while (r - l > 1) {
    int mid = (l + r) / 2;
    if (check(mid))
      r = mid;
    else
      l = mid;
  }
  long long ans = 1e9 + 10;
  for (int i = 0; i < n; i++)
    if (v[i] >= r) ans = min(ans, c[i]);
  if (ans == 1e9 + 10)
    cout << "-1\n";
  else
    cout << ans << "\n";
  return 0;
}
