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;
long long maxTime;
vector<pair<int, int> > prune(vector<pair<int, int> > cars) {
  sort(cars.begin(), cars.end());
  vector<pair<int, int> > ret;
  int befTank = -123;
  for (auto& it : cars) {
    if (it.second > befTank) {
      befTank = it.second;
      ret.push_back(it);
    }
  }
  return ret;
}
bool can(pair<int, int> c, const vector<int>& gases) {
  int now = 0;
  int tank = c.second;
  long long tm = 0;
  for (auto& it : gases) {
    if (it - now > tank) {
      return false;
    }
    int rem = tank - (it - now);
    tm += 2ll * (it - now);
    tm -= min(rem, it - now);
    now = it;
  }
  return tm <= maxTime;
}
int main() {
  ios::sync_with_stdio(false);
  int n, k, s;
  cin >> n >> k >> s >> maxTime;
  vector<pair<int, int> > cars;
  for (int i = 0; i < n; i++) {
    int price, tank;
    cin >> price >> tank;
    cars.push_back(make_pair(price, tank));
  }
  cars = prune(cars);
  vector<int> gases;
  for (int i = 0; i < k; i++) {
    int pos;
    cin >> pos;
    gases.push_back(pos);
  }
  gases.push_back(s);
  sort(gases.begin(), gases.end());
  int lo = 0, hi = cars.size() - 1;
  int ans = -1;
  while (lo <= hi) {
    int md = (lo + hi) / 2;
    if (can(cars[md], gases)) {
      hi = md - 1;
      ans = cars[md].first;
    } else {
      lo = md + 1;
    }
  }
  cout << ans << endl;
  return 0;
}
