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 MAX = 2e5 + 9, INF = 1e9 + 2;
long long ar[MAX], par[MAX], c[MAX], v[MAX], n, k, s, t, ans = INF;
int main() {
  ios_base::sync_with_stdio(false), cin.tie(0), cout.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 >> ar[i];
  sort(ar, ar + k), ar[k] = s;
  for (int i = k - 1; i >= 0; i--) ar[i + 1] -= ar[i];
  sort(ar, ar + k + 1);
  for (int i = 1; i <= k + 1; i++) par[i] = par[i - 1] + ar[i - 1];
  for (int i = 0; i < n; i++)
    if (ar[k] <= v[i]) {
      long long pos = upper_bound(ar, ar + k + 1, v[i] / 2) - ar;
      long long tmp =
          2 * s - par[pos] - (k + 1 - pos) * v[i] + (par[k + 1] - par[pos]);
      if (tmp <= t) ans = min(ans, c[i]);
    }
  if (ans == INF)
    cout << -1;
  else
    cout << ans;
  return 0;
}
