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 MAXN = 200005;
int n, k;
long long s, t;
long long c[MAXN], v[MAXN];
long long g[MAXN];
vector<long long> vs;
void init() {
  cin >> n >> k >> s >> t;
  for (int i = 0; i < n; i++) {
    scanf("%lld %lld", &c[i], &v[i]);
    vs.push_back(v[i]);
  }
  sort(vs.begin(), vs.end());
  vs.push_back(1e9 + 7);
  g[0] = 0;
  for (int i = 1; i <= k; i++) {
    scanf("%lld", &g[i]);
  }
  sort(g + 1, g + k + 1);
  g[k + 1] = s;
}
bool check(long long V) {
  long long sum = 0;
  for (int i = 0; i <= k; i++) {
    long long d = g[i + 1] - g[i];
    if (V < d) return 0;
    if (V > 2LL * d)
      sum += d;
    else
      sum += 3LL * d - V;
  }
  return sum <= t;
}
void solve() {
  int l = 0, r = n;
  while (l != r) {
    int mid = (l + r) >> 1;
    if (check(vs[mid]))
      r = mid;
    else
      l = mid + 1;
  }
  long long ans = 1e9 + 7;
  for (int i = 0; i < n; i++) {
    if (v[i] >= vs[r]) ans = min(ans, c[i]);
  }
  if (ans == 1e9 + 7 || r == n) {
    puts("-1");
    return;
  }
  cout << ans << '\n';
}
int main() {
  init();
  solve();
}
