Problem: In addition to complaints about lighting, a lot of complaints about insufficient radio signal covering has been received by Bertown city hall recently. n complaints were sent to the mayor, all of which are suspiciosly similar to each other: in the i-th complaint, one of the radio fans has mentioned that the signals of two radio stations x_i and y_i are not covering some parts of the city, and demanded that the signal of at least one of these stations can be received in the whole city.

Of cousre, the mayor of Bertown is currently working to satisfy these complaints. A new radio tower has been installed in Bertown, it can transmit a signal with any integer power from 1 to M (let's denote the signal power as f). The mayor has decided that he will choose a set of radio stations and establish a contract with every chosen station. To establish a contract with the i-th station, the following conditions should be met:

  * the signal power f should be not less than l_i, otherwise the signal of the i-th station won't cover the whole city; 
  * the signal power f should be not greater than r_i, otherwise the signal will be received by the residents of other towns which haven't established a contract with the i-th station. 



All this information was already enough for the mayor to realise that choosing the stations is hard. But after consulting with specialists, he learned that some stations the signals of some stations may interfere with each other: there are m pairs of stations (u_i, v_i) that use the same signal frequencies, and for each such pair it is impossible to establish contracts with both stations. If stations x and y use the same frequencies, and y and z use the same frequencies, it does not imply that x and z use the same frequencies.

The mayor finds it really hard to analyze this situation, so he hired you to help him. You have to choose signal power f and a set of stations to establish contracts with such that:

  * all complaints are satisfied (formally, for every i ∈ [1, n] the city establishes a contract either with station x_i, or with station y_i); 
  * no two chosen stations interfere with each other (formally, for every i ∈ [1, m] the city does not establish a contract either with station u_i, or with station v_i); 
  * for each chosen station, the conditions on signal power are met (formally, for each chosen station i the condition l_i ≤ f ≤ r_i is met). 

Input

The first line contains 4 integers n, p, M and m (2 ≤ n, p, M, m ≤ 4 ⋅ 10^5) — the number of complaints, the number of radio stations, maximum signal power and the number of interfering pairs, respectively.

Then n lines follow, which describe the complains. Each line contains two integers x_i and y_i (1 ≤ x_i < y_i ≤ p) — the indices of the radio stations mentioned in the i-th complaint). All complaints are distinct.

Then p lines follow, which describe the radio stations. Each line contains two integers l_i and r_i (1 ≤ l_i ≤ r_i ≤ M) — the constrains on signal power that should be satisfied if the city establishes a contract with the i-th station.

Then m lines follow, which describe the pairs of interfering radio stations. Each line contains two integers u_i and v_i (1 ≤ u_i < v_i ≤ p) — the indices of interfering radio stations. All these pairs are distinct.

Output

If it is impossible to choose signal power and a set of stations to meet all conditions, print -1.

Otherwise print two integers k and f in the first line — the number of stations in the chosen set and the chosen signal power, respectively. In the second line print k distinct integers from 1 to p — the indices of stations to establish contracts with (in any order). If there are multiple answers, print any of them; you don't have to minimize/maximize the number of chosen stations, and the same applies to signal power.

Examples

Input


2 4 4 2
1 3
2 3
1 4
1 2
3 4
1 4
1 2
3 4


Output


2 3
1 3 

Input


2 4 4 2
1 3
2 4
1 2
1 2
3 4
3 4
1 2
3 4


Output


-1

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
inline int read() {
  int SUM = 0, ff = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') ff = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    SUM = (SUM << 3) + (SUM << 1) + (ch ^ 48);
    ch = getchar();
  }
  return SUM * ff;
}
inline int yes(int x) { return x << 1; }
inline int no(int x) { return x << 1 | 1; }
const int N = 2000010;
struct edge {
  int nxt, to;
} e[N << 2];
int h[N], cnte = 1;
inline void addedge(int u, int v) { e[++cnte] = (edge){h[u], v}, h[u] = cnte; }
int n, m, p, q;
int dfn[N], low[N], Time;
int stk[N], tops;
int belong[N], scc;
bool ins[N];
inline void Tarjan(int u) {
  dfn[u] = low[u] = ++Time;
  stk[++tops] = u;
  ins[u] = 1;
  for (int i = h[u]; i; i = e[i].nxt) {
    int v = e[i].to;
    if (!dfn[v]) {
      Tarjan(v);
      low[u] = min(low[u], low[v]);
    } else if (ins[v]) {
      low[u] = min(low[u], dfn[v]);
    }
  }
  if (low[u] == dfn[u]) {
    scc++;
    int y = 0;
    do {
      y = stk[tops--];
      belong[y] = scc;
      ins[y] = 0;
    } while (y != u);
  }
}
inline void build() {
  for (int i = 1; i <= q; i++) {
    int x = read(), y = read();
    addedge(no(x), yes(y));
    addedge(no(y), yes(x));
  }
  for (int i = 0; i <= m; i++) {
    addedge(yes(n + i + 1), yes(n + i + 2));
    addedge(no(n + i + 2), no(n + i + 1));
  }
  addedge(yes(n + 1), no(n + 1));
  for (int i = 1; i <= n; i++) {
    int l = read(), r = read();
    addedge(yes(i), no(n + l));
    addedge(yes(i), yes(n + r + 1));
    addedge(yes(n + l), no(i));
    addedge(no(n + r + 1), no(i));
  }
  for (int i = 1; i <= p; i++) {
    int x = read(), y = read();
    addedge(yes(x), no(y));
    addedge(yes(y), no(x));
  }
}
inline void solve() {
  for (int i = yes(1); i <= no(n + m + 2); i++)
    if (!dfn[i]) Tarjan(i);
  for (int i = 1; i <= n + m + 2; i++)
    if (belong[yes(i)] == belong[no(i)]) {
      puts("-1");
      return;
    }
  vector<int> radio;
  for (int i = 1; i <= n; i++)
    if (belong[yes(i)] < belong[no(i)]) radio.push_back(i);
  for (int i = 1; i <= m; i++) {
    if (belong[yes(n + i + 1)] < belong[no(n + i + 1)]) {
      printf("%d %d\n", radio.size(), i);
      break;
    }
  }
  for (auto x : radio) printf("%d ", x);
  puts("");
}
int main() {
  q = read(), n = read(), m = read(), p = read();
  build();
  solve();
  return 0;
}