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>
int cmp(const void *a, const void *b) { return *(int *)a - *(int *)b; }
long long n, k, s, t;
struct data {
  long long price;
  long long fuel;
} x[200005];
long long g[200005];
int judge(int f) {
  int i;
  long long time = 0, len = 0;
  for (i = 1; i <= k + 1; i++) {
    long long d = g[i] - g[i - 1];
    if (f < d) return 0;
    if (len + d < s) {
      len += d;
      long long a1 = f - d > d ? d : f - d;
      long long a2 = d - a1;
      time += (a1 + 2 * a2);
    } else {
      d = s - len;
      long long a1 = f - d > d ? d : f - d;
      long long a2 = d - a1;
      time += (a1 + 2 * a2);
      break;
    }
  }
  return time <= t ? 1 : 0;
}
int bs(int left, int right) {
  int mid = (left + right) / 2;
  while (left <= right) {
    if (judge(mid) == 0)
      left = mid + 1;
    else
      right = mid - 1;
    mid = (left + right) / 2;
  }
  return left;
}
int main() {
  scanf("%I64d %I64d %I64d %I64d", &n, &k, &s, &t);
  int i;
  long long min = INT_MAX;
  for (i = 0; i < n; i++) scanf("%I64d %I64d", &x[i].price, &x[i].fuel);
  for (i = 1; i <= k; i++) scanf("%I64d", &g[i]);
  g[k + 1] = s;
  qsort(g, k + 1, sizeof(long long), cmp);
  int line = bs(1, 1000000000);
  for (i = 0; i < n; i++) {
    if (x[i].fuel >= line)
      if (x[i].price < min) min = x[i].price;
  }
  printf("%d", min);
}
