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 n, k, s, t;
pair<int, int> cars[200200];
vector<int> dist(200200);
int solve(int dist, int tank) {
  int l = 0, r = dist;
  while (l < r) {
    int mid = (l + r) >> 1;
    if (2 * mid + max(dist - mid, 0) <= tank)
      l = mid + 1;
    else
      r = mid;
  }
  cout << "L"
       << " " << l - 1 << endl;
  return max(l - 1, 0);
}
bool check(int tank) {
  long long int temp = 2 * s;
  long long int acce = 0;
  long long int normal = temp;
  if (temp > t) {
    acce = temp - t;
    normal = (s - acce) * 2;
  }
  if (acce > t) return false;
  long long int tot = 0;
  for (int i = 0; i <= k; i++) {
    if (dist[i] <= tank)
      tot += solve(dist[i], tank);
    else
      return false;
  }
  return (acce <= tot);
}
int main() {
  cin >> n >> k >> s >> t;
  int c, v;
  if (s > t) {
    cout << -1;
    return 0;
  }
  for (int i = 0; i < n; i++) {
    cin >> c >> v;
    cars[i] = make_pair(v, c);
  }
  int g;
  cin >> g;
  dist.push_back(g);
  for (int i = 1; i < k; i++) {
    cin >> g;
    dist.push_back(g - dist[i - 1]);
  }
  dist.push_back(s - dist[k - 1]);
  sort(cars, cars + n);
  int l = 0, r = n - 1;
  while (l < r) {
    int mid = (l + r) / 2;
    if (check(cars[mid].first))
      r = mid;
    else
      l = mid + 1;
  }
  cout << r << " " << l << endl;
  cout << check(6) << endl;
  int ans = 1e9 + 20;
  for (int i = r; i < n; i++) ans = min(cars[i].second, ans);
  if (r == n - 1 && !check(cars[n - 1].first))
    cout << -1;
  else if (ans > 1e9)
    cout << -1;
  else
    cout << ans;
}
