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;
using namespace placeholders;
const int MAXN = 2E5 + 10;
int n, K, S, T;
int v[MAXN], c[MAXN];
int a[MAXN];
int s[MAXN];
int main() {
  scanf("%d%d%d%d", &n, &K, &S, &T);
  for (int i = 1; i <= n; ++i) scanf("%d%d", c + i, v + i);
  for (int i = 1; i <= K; ++i) scanf("%d", a + i);
  a[++K] = S;
  sort(a + 1, a + K + 1);
  for (int i = K; i > 0; --i) a[i] -= a[i - 1];
  sort(a + 1, a + K + 1);
  for (int i = 1; i <= K; ++i) s[i] = s[i - 1] + a[i];
  const int INF = 2E9;
  int ans = INF;
  for (int i = 1; i <= n; ++i) {
    if (a[K] > v[i]) continue;
    int r = lower_bound(a + 1, a + K + 1, v[i] + 1 >> 1) - a - 1;
    long long cost = s[r] + (s[K] - s[r]) * 3ll - (long long)(K - r) * v[i];
    if (cost <= T) ans = min(ans, c[i]);
  }
  printf("%d\n", ans == INF ? -1 : ans);
  return 0;
}
