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 inf = (1 << 30) - 1;
const long long linf = (1ll << 62) - 1;
int main() {
  long long n, k, s, t;
  cin >> n >> k >> s >> t;
  vector<pair<long long, long long>> cars(n);
  for (auto &i : cars) {
    scanf("%lld%lld", &i.first, &i.second);
  }
  vector<long long> g(k + 2);
  g[0] = 0;
  g[k + 1] = s;
  for (int i = 1; i <= k; i++) {
    scanf("%lld", &g[i]);
  }
  sort((g).begin(), (g).end());
  k += 2;
  long long l = 0, r = 1e10 + 100;
  while (r - l > 1) {
    long long m = (l + r) / 2;
    long long total_time = 0;
    for (int i = 0; i < k - 1; i++) {
      if (m < g[i + 1] - g[i]) {
        total_time = linf;
        break;
      }
      total_time += g[i + 1] - g[i];
      long long left = 2 * (g[i + 1] - g[i]) - m;
      total_time += max(0LL, left);
    }
    if (total_time > t) {
      l = m;
    } else {
      r = m;
    }
  }
  long long min_cost = linf;
  for (auto i : cars) {
    if (i.second >= r) {
      min_cost = min(min_cost, i.first);
    }
  }
  if (min_cost >= linf) {
    min_cost = -1;
  }
  cout << min_cost << endl;
  return 0;
}
