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>
const int maxn = 2e5 + 8;
using namespace std;
pair<int, int> A[maxn];
int K[maxn];
int n, k, s, t;
bool check(int x) {
  int ans = 0;
  for (int i = 1; i <= k + 1; i++) {
    int l = K[i] - K[i - 1];
    if (x >= 2 * l) {
      ans += l;
      continue;
    }
    if (x < l) {
      return 0;
    }
    ans += 3 * l - x;
  }
  return ans;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cin >> n >> k >> s >> t;
  int maxy, mini;
  for (int i = 0; i < n; i++) cin >> A[i].first >> A[i].second;
  for (int i = 1; i <= k; i++) cin >> K[i];
  K[k + 1] = s;
  K[0] = 0;
  sort(K, K + k);
  maxy++;
  mini = 0, maxy = 2e9 + 85 - 69;
  while (maxy - mini > 1) {
    int p;
    int mid = mini + maxy;
    mid /= 2;
    if (t <= check(mid))
      maxy = mid;
    else
      mini = mid;
  }
  if (t > check(maxy) and t <= check(mini)) maxy = mini;
  cout << maxy << ' ' << check(6);
  if (t > check(maxy)) {
    cout << "-1" << endl;
    return 0;
  }
  int ans = maxy;
  sort(A, A + n);
  for (int i = 0; i < n; i++)
    if (A[i].second >= ans) {
      cout << A[i].first << endl;
      return 0;
    }
  cout << "-1" << endl;
  return 0;
}
