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;
int c[200010], v[200010], gas[200010];
int n, k, s, t;
int judge(int x) {
  int timeUse = 0, len, fastS, slowS;
  for (int i = 1; i <= k + 1; i++) {
    len = gas[i] - gas[i - 1];
    if (x < len) return 0;
    fastS = x - len;
    slowS = 2 * len - x;
    if (slowS > 0)
      timeUse += (fastS + slowS * 2);
    else
      timeUse += len;
  }
  if (timeUse <= t)
    return 1;
  else
    return 0;
}
int main() {
  long long l, r, mid;
  cin >> 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", &gas[i]);
  gas[k + 1] = s;
  sort(gas, gas + k + 2);
  l = 0;
  r = s * 2 + 1;
  while (l < r) {
    mid = (l + r) / 2;
    if (judge(mid))
      r = mid;
    else
      l = mid + 1;
  }
  int minPrice = INT_MAX;
  for (int i = 1; i <= n; i++)
    if (c[i] <= minPrice && v[i] >= l && r != s * 2 + 1) minPrice = c[i];
  if (minPrice == INT_MAX)
    cout << -1 << endl;
  else
    cout << minPrice << endl;
  return 0;
}
