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 long long mod = 7;
void rd(long long &x) {
  x = 0;
  char s;
  s = getchar();
  long long f = 1;
  while (!isdigit(s)) {
    if (s == '-') f -= 1;
    s = getchar();
  }
  while (isdigit(s)) {
    x = x * 10 + s - '0';
    s = getchar();
  }
  x *= f;
}
bool isp(long long x) {
  long long tt = sqrt(x * 1.0);
  for (long long i = 2; i <= tt; i++) {
    if (x % i == 0) return 0;
  }
  return 1;
}
long long quick_mod(long long a, long long b) {
  long long res = 1;
  while (b) {
    if (b & 1) {
      res = res * a;
      res %= mod;
    }
    b >>= 1;
    a = a * a;
    a %= mod;
  }
  return res;
}
long long n, k, s, t;
struct node {
  long long cost, cap;
} a[212345];
long long pos[212345];
int main() {
  cin >> n >> k >> s >> t;
  if (t < s) {
    return cout << -1 << '\n', 0;
  }
  for (long long i = 1; i <= n; i++) {
    rd(a[i].cost), rd(a[i].cap);
  }
  for (long long i = 1; i <= k; i++) {
    rd(pos[i]);
  }
  sort(pos + 1, pos + k + 1);
  pos[0] = 0;
  pos[k + 1] = s;
  long long l = 1, r = 0x3f3f3f3f3f3f3f3f;
  ;
  while (l < r) {
    long long mid = l + r;
    mid >>= 1;
    long long tem = 0;
    for (long long i = 0; i <= k; i++) {
      tem += pos[i + 1] - pos[i];
      if (mid < (pos[i + 1] - pos[i])) {
        tem = 0x3f3f3f3f3f3f3f3f;
        break;
      } else
        tem += max((long long)0,
                   (pos[i + 1] - pos[i]) - (mid - (pos[i + 1] - pos[i])));
    }
    if (tem <= t) {
      r = mid;
    } else {
      l = mid + 1;
    }
  }
  long long ans = 0x3f3f3f3f3f3f3f3f;
  for (long long i = 1; i <= n; i++) {
    if (a[i].cap >= l) {
      ans = min(ans, a[i].cost);
    }
  }
  if (ans == 0x3f3f3f3f3f3f3f3f) {
    cout << -1 << '\n';
  } else {
    cout << ans << '\n';
  }
  return 0;
}
