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;
using pii = pair<int, int>;
static const int INF = 1000000010;
int main() {
  ios_base::sync_with_stdio(false);
  int n, k, s, t;
  cin >> n >> k >> s >> t;
  vector<pii> cars(n);
  for (int i = 0; i < n; ++i) {
    cin >> cars[i].second >> cars[i].first;
  }
  sort(cars.begin(), cars.end());
  vector<int> g(k);
  for (int i = 0; i < k; ++i) {
    cin >> g[i];
  }
  sort(g.begin(), g.end());
  g.push_back(s);
  ++k;
  vector<int> f(k);
  for (int i = 0, p = 0; i < k; ++i) {
    f[i] = g[i] - p;
    p = g[i];
  }
  sort(f.begin(), f.end());
  vector<int> integral(k + 1);
  for (int i = 0; i < k; ++i) {
    integral[i + 1] = integral[i] + f[i];
  }
  int answer = INF;
  for (const auto& car : cars) {
    const int c = car.second, v = car.first;
    if (f.back() > v) {
      continue;
    }
    int score = 0;
    const int p = upper_bound(f.begin(), f.end(), v / 2) - f.begin();
    const int q = integral[k] - integral[p];
    score += integral[p] - integral[0];
    score += 2 * q - ((v * (k - p)) - q);
    if (score <= t) {
      answer = min(answer, c);
    }
  }
  if (answer >= INF) {
    answer = -1;
  }
  cout << answer << endl;
  return 0;
}
