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;
pair<long long, long long> a[250001];
long long b[250001], n, i, k, s, t, l, r, mid, sum, big, nom, ans;
bool comp(pair<long long, long long> a, pair<long long, long long> b) {
  if (a.second < b.second) return 1;
  return 0;
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cin >> n >> k >> s >> t;
  for (i = 1; i <= n; i++) cin >> a[i].first >> a[i].second;
  for (i = 1; i <= k; i++) cin >> b[i];
  sort(b + 1, b + 1 + k);
  for (i = 1; i <= k; i++) big = max(big, b[i] - b[i - 1]);
  big = max(big, s - b[k]);
  sort(a + 1, a + 1 + n, comp);
  l = 1;
  r = n;
  while (l <= r) {
    mid = (l + r) / 2;
    if (a[mid].second < big) {
      l = mid + 1;
      continue;
    }
    sum = 0;
    for (i = 1; i <= k; i++)
      sum += min(a[mid].second - (b[i] - b[i - 1]), b[i] - b[i - 1]);
    sum += min(a[mid].second - (s - b[k]), s - b[k]);
    sum = s * 2 - sum;
    if (sum <= t) {
      r = mid - 1;
      nom = mid;
    } else
      l = mid + 1;
  }
  if (nom == 0) {
    cout << "-1" << '\n';
    return 0;
  }
  ans = 9000000000000000000LL;
  for (i = nom; i <= n; i++) ans = min(ans, a[i].first);
  cout << ans << '\n';
  return 0;
}
