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 MAX = 200009;
int n, k;
long long s, t;
struct car {
  long long c, v;
  car() {}
  bool operator<(const car& o) const {
    if (v != o.v) return v < o.v;
    return c < o.c;
  }
} C[MAX];
long long g[MAX];
bool check(long long cap) {
  long long ti = 0;
  for (int i = 1; i < k; i++) {
    long long dist = g[i] - g[i - 1];
    if (dist > cap) return false;
    if (2 * dist <= cap) {
      ti += dist;
      continue;
    }
    ti += (cap - dist) + (dist - (cap - dist)) * 2LL;
  }
  return ti <= t;
}
long long Min[MAX];
int main() {
  ios::sync_with_stdio(false);
  cin >> n >> k >> s >> t;
  for (int i = 0; i < n; i++) {
    cin >> C[i].c >> C[i].v;
  }
  sort(C, C + n);
  reverse(C, C + n);
  for (int i = 1; i <= k; i++) cin >> g[i];
  g[0] = 0;
  g[k + 1] = s;
  k += 2;
  sort(g, g + k);
  Min[0] = C[0].c;
  for (int i = 1; i < n; i++) Min[i] = min(Min[i - 1], C[i].c);
  int l = 0, r = n - 1, ans = -1;
  while (l <= r) {
    int mid = (l + r) / 2;
    if (check(C[mid].v)) {
      ans = mid;
      l = mid + 1;
    } else {
      r = mid - 1;
    }
  }
  if (ans == -1)
    cout << -1 << endl;
  else
    cout << Min[ans] << endl;
  return 0;
}
