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 + 5;
int n, k, s, t;
int cost[N];
int cap[N];
int g[N];
int f(int x) {
  int cur = 0;
  for (int i = 0; i <= k; i++) {
    int dist;
    if (i == 0)
      dist = g[i];
    else
      dist = g[i] - g[i - 1];
    if (dist > x) return 0;
    int two = min(dist, x - dist);
    int one = dist - two;
    cur += 2 * one + two;
  }
  return (cur <= t);
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> k >> s >> t;
  for (int i = 1; i <= n; i++) {
    cin >> cost[i] >> cap[i];
  }
  long long int lo = 1;
  long long int hi = INT_MAX;
  for (int i = 0; i < k; i++) {
    cin >> g[i];
  }
  g[k] = s;
  sort(g, g + k);
  int ans = INT_MAX;
  while (hi - lo > 2) {
    long long int mid = hi + lo;
    mid /= 2;
    if (!f(mid))
      lo = mid;
    else
      hi = mid;
  }
  while (!f(lo) and lo <= hi) lo++;
  for (int i = 1; i <= n; i++) {
    if (cap[i] >= lo) {
      ans = min(ans, cost[i]);
    }
  }
  if (ans == INT_MAX) ans = -1;
  cout << ans << endl;
}
