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 dx[] = {-1, 1, 0, 0};
int dy[] = {0, 0, -1, 1};
int n, k, s, t, c[200010], v[200010], g[200010], sum[200010];
vector<int> l;
bool check(int V) {
  if (V < l.back()) return false;
  auto it = upper_bound(l.begin(), l.end(), V / 2);
  int cost = 0;
  if (it != l.end()) {
    int pos = it - l.begin();
    int len = s - sum[pos];
    cost += 3 * len - V * (int((l).size()) - pos);
    cost += sum[pos];
  } else {
    cost = s;
  }
  return cost <= t;
}
int solve() {
  sort((l).begin(), (l).end());
  for (int i = 1; i < int((l).size()); i++) sum[i] = sum[i - 1] + l[i - 1];
  int ans = -1;
  for (int i = 0; i < n; i++) {
    if (check(v[i])) ans = ans == -1 ? c[i] : min(ans, c[i]);
  }
  return ans;
}
int main() {
  scanf("%d%d%d%d", &n, &k, &s, &t);
  for (int i = 0; i < n; i++) scanf("%d%d", &c[i], &v[i]);
  for (int i = 1; i <= k; i++) scanf("%d", &g[i]);
  sort(g + 1, g + 1 + k);
  for (int i = 1; i <= k; i++) l.push_back(g[i] - g[i - 1]);
  l.push_back(s - g[k]);
  printf("%d\n", solve());
  return 0;
}
