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;
long long l[200005], flag, a[200005], b[200005];
typedef struct fact {
  long long a, b;
} fact;
fact c[100005];
bool cmp(fact n, fact m) {
  if (n.b == m.b) {
    return n.a < m.a;
  }
  return n.b < m.b;
}
bool Judge(long long mid, long long k, long long t) {
  long long d, i;
  double T = 0;
  for (i = 1; i <= k + 1; i++) {
    d = l[i] - l[i - 1];
    if (mid < d) {
      return 0;
    }
    if (2 * d <= mid) {
      T += d;
    } else {
      T += (3 * d - mid);
    }
    if (T > t) {
      return 0;
    }
  }
  flag = 1;
  return 1;
}
int main() {
  long long n, k, s, t, i, left = 0, right, mid, result, x;
  cin >> n >> k >> s >> t;
  for (i = 0; i < n; i++) {
    cin >> a[i] >> b[i];
    c[i].a = a[i];
    c[i].b = b[i];
  }
  l[0] = 0;
  for (i = 1; i <= k; i++) {
    cin >> l[i];
  }
  l[k + 1] = s;
  sort(l, l + k + 2);
  right = 2 * s;
  flag = 0;
  while (left < right) {
    mid = (left + right) / 2;
    if (Judge(mid, k, t) == 1) {
      right = mid;
    } else {
      left = mid + 1;
    }
  }
  if (flag == 0) {
    cout << "-1" << endl;
    return 0;
  }
  cout << left << endl;
  c[n].a = 0;
  c[n].b = left;
  sort(c, c + n + 1, cmp);
  x = lower_bound(b, b + n + 1, left) - b;
  if (c[n].b < left || (c[n].b == left && c[n].a == 0)) {
    cout << "-1" << endl;
  } else if (c[n].b == left) {
    cout << c[n].a << endl;
  } else {
    if (left == c[x].b && c[x].a != 0) {
      cout << c[x].a << endl;
    } else {
      cout << c[x + 1].a << endl;
    }
  }
  return 0;
}
