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 unsigned long long max_ull = 18446744073709551615ull;
const long long max_ll = 9223372036854775807ll;
unsigned long long nextInt() {
  unsigned long long sum = 0;
  char a;
  while (true) {
    a = getchar();
    if (a < '0' || a > '9') return sum;
    sum = sum * 10 + (unsigned long long)(a - '0');
  }
}
vector<pair<long long, long long> > g, g2;
long long n, k, s, t, ans = -1, mxb = 0, gas[200050], l, r, m;
int main() {
  n = nextInt();
  k = nextInt();
  s = nextInt();
  t = nextInt();
  g.resize(n);
  for (int i = 0; i < n; i++) {
    g[i].first = nextInt();
    g[i].second = nextInt();
  }
  for (int i = 0; i < k; i++) gas[i] = nextInt();
  gas[k] = s;
  sort(gas, gas + k);
  k++;
  sort(g.begin(), g.end());
  for (int i = 0; i < n; i++)
    if (g[i].second > mxb) {
      g2.push_back(g[i]);
      mxb = g[i].second;
    }
  l = 0;
  r = g2.size() - 1;
  while (l <= r) {
    m = (l + r) / 2;
    long long time = 0, hg = g2[m].second, lst_x = 0;
    for (int i = 0; i < k; i++) {
      if (hg < gas[i] - lst_x) {
        time = t + 2;
        break;
      }
      hg -= gas[i] - lst_x;
      time += (gas[i] - lst_x) * 2;
      time -= min(hg, gas[i] - lst_x);
      hg = g2[m].second;
      lst_x = gas[i];
    }
    if (time <= t) {
      ans = g2[m].first;
      r = m - 1;
    } else
      l = m + 1;
  }
  printf("%d\n", (int)ans);
  return 0;
}
