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 OO = 2e9;
const int MOD = 1e9 + 7;
const double Pi = 3.141592653589793;
const int N = 3e5 + 5;
long long c[N], v[N], g[N], a[N], n, k, s, t, m = 0, mx = 0, mn = -1, res = OO;
bool check(long long cap) {
  long long time = 0;
  for (int i = (int)1; i <= (int)m; i++) {
    if (a[i] > cap) return false;
    long long y = max(0LL, min(a[i], cap - a[i])), x = a[i] - y;
    time += 2LL * x + y;
  }
  return (time <= t);
}
int main() {
  cin >> n >> k >> s >> t;
  if (s > t) {
    cout << -1;
    return 0;
  }
  for (int i = (int)1; i <= (int)n; i++) scanf("%i%i", &v[i], &c[i]);
  for (int i = (int)1; i <= (int)k; i++) scanf("%i", &g[i]);
  g[++k] = s;
  g[++k] = 0;
  sort(g + 1, g + k + 1);
  for (int i = (int)2; i <= (int)k; i++)
    a[++m] = g[i] - g[i - 1], mx = max(mx, a[m]);
  long long l = mx, r = s * 2, mid;
  while (l <= r) {
    mid = (l + r) >> 1;
    if (check(mid))
      mn = mid, r = mid - 1;
    else
      l = mid + 1;
  }
  for (int i = (int)1; i <= (int)n; i++)
    if (c[i] >= mn) res = min(res, v[i]);
  if (res == OO)
    cout << -1;
  else
    cout << res;
}
