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;
struct car {
  int c, v;
};
bool operator<(car a, car b) { return a.v < b.v; }
int main() {
  ios::sync_with_stdio(false);
  int n, k, s, t;
  cin >> n >> k >> s >> t;
  vector<car> arr(n);
  for (int i = 0; i < n; i++) cin >> arr[i].c >> arr[i].v;
  vector<int> g(k + 2);
  g[0] = 0;
  for (int i(1); i <= k; i++) cin >> g[i];
  k += 2;
  g[k - 1] = s;
  sort(arr.begin(), arr.end());
  sort(g.begin(), g.end());
  int l = -1, r = n;
  int cnt = 0;
  while (r - l > 1) {
    cnt++;
    int m = (r + l) / 2;
    int time = 0;
    for (int i(1); i < k; i++) {
      int d = g[i] - g[i - 1];
      int a = min(arr[m].v - d, d);
      int norm = d - a;
      if (arr[m].v < d) {
        time = 2000000007;
        break;
      }
      time += a + 2 * norm;
    }
    if (time > t)
      l = m;
    else
      r = m;
  }
  if (r == n)
    cout << -1 << endl;
  else {
    int ans = 1000000007;
    for (int i = r; i < n; ++i) ans = min(ans, arr[i].c);
    cout << ans << endl;
  }
  return 0;
}
