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 main() {
  cin.tie(0);
  cout.tie(0);
  ios_base::sync_with_stdio(0);
  long long n, k, s, t;
  cin >> n >> k >> s >> t;
  vector<long long> c(n), v(n), g(k + 1, 1e9 + 5), f(k + 2, 0);
  for (int i = 0; i < n; i++) cin >> c[i] >> v[i];
  for (int i = 0; i < k; i++) cin >> g[i];
  sort(g.begin(), g.end());
  g[k] = s;
  for (int i = k - 1; i >= 0; i--) g[i + 1] -= g[i];
  sort(g.begin(), g.end());
  for (int i = 1; i <= k + 1; i++) f[i] = f[i - 1] + g[i - 1];
  long long ret = -1;
  for (int i = 0; i < n; i++)
    if (g[k] <= v[i]) {
      long long x = upper_bound(g.begin(), g.end(), v[i] / 2) - g.begin();
      if (2 * s - f[x] - (k + 1 - x) * v[i] + (f[k + 1] - f[x]) <= t) {
        if (ret == -1)
          ret = c[i];
        else
          ret = min(ret, c[i]);
      }
    }
  cout << ret << endl;
  return 0;
}
