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;
struct car {
  long long v, c;
};
bool comp(const car &a, const car &b) { return a.v > b.v; }
long long g[202020];
car m[202020];
int n, k;
long long s, t;
bool gtime(int val) {
  long long cur(0), res(0);
  for (int i(0); i < k; ++i) {
    if (g[i] - cur > m[val].v) return false;
    long long dist(g[i] - cur);
    res += max(dist, 3 * dist - m[val].v);
    cur = g[i];
  }
  return res <= t;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin >> n >> k >> s >> t;
  for (int i(0); i < n; ++i) cin >> m[i].c >> m[i].v;
  sort(m, m + n, comp);
  for (int i(0); i < k; ++i) cin >> g[i];
  g[k++] = s;
  sort(g, g + k);
  int l(0), r(n);
  while (l + 1 < r) {
    if (gtime((l + r) / 2)) {
      l = (l + r) / 2;
    } else
      r = (l + r) / 2;
  }
  if (!gtime(l)) {
    cout << -1;
    return 0;
  }
  long long ans(1e9 + 1);
  for (int i(0); i <= l; ++i) ans = min(ans, m[i].c);
  cout << ans;
}
