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>
#pragma comment(linker, ”/ STACK : 38777216“
using namespace std;
const int N = 200005;
const int inf = 2 * 1000 * 1000 * 1000;
const int mod = 1000 * 1000 * 1000 + 7;
int n, k;
long long s, t;
pair<long long, long long> p[N];
long long g[N];
int main() {
  scanf("%d%d%lld%lld", &n, &k, &s, &t);
  for (int i = 1; i <= n; i++) scanf("%lld%lld", &p[i].first, &p[i].second);
  sort(p + 1, p + n + 1);
  for (int i = 2; i <= n; i++) p[i].second = max(p[i].second, p[i - 1].second);
  for (int i = 1; i <= k; i++) scanf("%lld", &g[i]);
  sort(g + 1, g + k + 1);
  g[0] = 0;
  g[k + 1] = s;
  int ina = 1, inb = n;
  long long answ = -1;
  while (ina <= inb) {
    int mid = (ina + inb) / 2;
    long long T = 0;
    long long S = p[mid].second;
    bool flag = true;
    for (int i = 0; i <= k; i++) {
      long long d = g[i + 1] - g[i];
      if (d > S) {
        flag = false;
        break;
      }
      long long delta = S - d;
      delta = min(delta, d);
      T += delta + (d - delta) * (2ll);
    }
    if (T > t) flag = false;
    if (flag) {
      answ = p[mid].first;
      inb = mid - 1;
    } else
      ina = mid + 1;
  }
  cout << answ << endl;
  return 0;
}
