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;
inline int ReadInt() {
  int t;
  scanf("%d", &t);
  return t;
}
inline long long ReadLong() {
  long long t;
  cin >> t;
  return t;
}
inline pair<int, int> ReadPair() {
  pair<int, int> t;
  t.first = ReadInt();
  t.second = ReadInt();
  return t;
}
inline string ReadStr() {
  string t;
  cin >> t;
  return t;
}
int MinC = 1e9 + 9;
int n, k, S, t, Maxd;
vector<pair<int, int> > Cars;
vector<int> Stations, Dist;
int main() {
  n = ReadInt();
  k = ReadInt();
  S = ReadInt();
  t = ReadInt();
  for (int i = 0; i < n; i++) {
    int c, v;
    c = ReadInt();
    v = ReadInt();
    Cars.push_back({v, c});
  }
  sort(Cars.begin(), Cars.end());
  Stations.push_back(0), Stations.push_back(S);
  for (int i = 0; i < k; i++) {
    Stations.push_back(ReadInt());
  }
  sort(Stations.begin(), Stations.end());
  for (int i = 1; i < k + 2; i++) {
    Dist.push_back(Stations[i] - Stations[i - 1]);
    Maxd = max(Maxd, Stations[i] - Stations[i - 1]);
  }
  sort(Dist.begin(), Dist.end());
  int L = -1;
  int l = 0, r = n - 1;
  while (l <= r) {
    int m = (l + r) >> 1;
    if (Cars[m].first >= Maxd) {
      L = m;
      r = m - 1;
    } else
      l = m + 1;
  }
  if (L == -1 || S > t) {
    cout << "-1\n";
    return 0;
  }
  if (S * 2 <= t) {
    while (L < n) {
      cout << Cars[L].first << " \n";
      MinC = min(MinC, Cars[L++].second);
    }
    cout << MinC << "\n";
  } else {
    int Start = -1;
    int Acc = S - (t - S);
    int Left = L, Right = n - 1;
    while (Left <= Right) {
      int i = (Left + Right) >> 1;
      bool ok = 0;
      int Done = 0;
      for (int j = 0; j < Dist.size(); j++) {
        int l = 0, r = Acc;
        int Take = 0;
        while (l <= r) {
          int m = (l + r) >> 1;
          long long Fuel = (long long)(m * 2) + (Dist[j] - m);
          if (Dist[j] - m < 0) {
            r = m - 1;
            continue;
          }
          if (Fuel <= Cars[i].first) {
            Take = m;
            l = m + 1;
          } else {
            r = m - 1;
          }
        }
        Done += Take;
        if (Done >= Acc) {
          Start = i;
          Right = i - 1;
          break;
        }
        if (Take == 0) {
          Left = i + 1;
          break;
        }
        if (j + 1 == Dist.size()) {
          Left = i + 1;
        }
      }
    }
    if (Start == -1) {
      cout << "-1\n";
    } else {
      while (Start < n) {
        MinC = min(MinC, Cars[Start++].second);
      }
      cout << MinC << "\n";
    }
  }
  return 0;
}
