Problem: A graph is called planar, if it can be drawn in such a way that its edges intersect only at their vertexes.

An articulation point is such a vertex of an undirected graph, that when removed increases the number of connected components of the graph.

A bridge is such an edge of an undirected graph, that when removed increases the number of connected components of the graph.

You've got a connected undirected planar graph consisting of n vertexes, numbered from 1 to n, drawn on the plane. The graph has no bridges, articulation points, loops and multiple edges. You are also given q queries. Each query is a cycle in the graph. The query response is the number of graph vertexes, which (if you draw a graph and the cycle on the plane) are located either inside the cycle, or on it. Write a program that, given the graph and the queries, will answer each query.

Input

The first line contains two space-separated integers n and m (3 ≤ n, m ≤ 105) — the number of vertexes and edges of the graph. Next m lines contain the edges of the graph: the i-th line contains two space-separated integers ui and vi (1 ≤ ui, vi ≤ n) — the numbers of vertexes, connecting the i-th edge. The next n lines contain the positions of the planar graph vertexes on the plane: the i-th line contains a pair of space-separated integers xi and yi (|xi|, |yi| ≤ 109) — the coordinates of the i-th vertex of the graph on the plane. 

The next line contains integer q (1 ≤ q ≤ 105) — the number of queries. Then follow q lines that describe the queries: the i-th line contains the sequence of space-separated integers ki, a1, a2, ..., aki (1 ≤ aj ≤ n; ki > 2), where ki is the cycle length in the i-th query, aj are numbers of the vertexes that form a cycle. The numbers of vertexes in the cycle are given in the clockwise or counterclockwise order. The given cycles are simple, that is they cannot go through a graph vertex more than once. The total length of all cycles in all queries does not exceed 105.

It is guaranteed that the given graph contains no bridges, articulation points, loops and multiple edges. It is guaranteed that the edge segments can have common points only at the graph's vertexes.

Output

For each query print a single integer — the number of vertexes inside the cycle or on it. Print the answers in the order, in which the queries follow in the input. Separate the numbers by spaces.

Examples

Input

3 3
1 2
2 3
3 1
0 0
1 0
0 1
1
3 1 2 3


Output

3


Input

5 8
1 2
2 3
3 4
4 1
1 5
2 5
3 5
4 5
0 0
2 0
2 2
0 2
1 1
1
4 1 2 3 4


Output

5


Input

4 5
1 2
2 3
3 4
4 1
2 4
0 0
1 0
1 1
0 1
3
3 1 2 4
3 4 2 3
4 1 2 3 4


Output

3
3
4

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
int n, m;
struct Point {
  long long x, y;
  Point(const long long &x = 0, const long long &y = 0) : x(x), y(y) {}
  Point operator+(const Point &B) const { return Point(x + B.x, y + B.y); }
  Point operator-(const Point &B) const { return Point(x - B.x, y - B.y); }
  long long operator*(const Point &B) const { return x * B.y - y * B.x; }
} P[100005];
int F[100005];
int Find(int u) { return !F[u] ? u : F[u] = Find(F[u]); }
vector<pair<double, int> > G[100005];
int sz[100005], sx[100005], ty[100005];
void dfs(int u, int ff) {
  sz[u] = 1;
  for (int i = 0, v; i < G[u].size() - 1; i++) {
    if ((v = G[u][i].second) == ff) swap(G[u][i], G[u].back());
    v = G[u][i].second;
    dfs(v, u);
    sz[u] += sz[v];
  }
}
int main() {
  scanf("%d%d", &n, &m);
  for (int i = (1), LIM = (m); i <= LIM; i++) scanf("%d%d", &sx[i], &ty[i]);
  int rt = 0;
  for (int i = (1), LIM = (n); i <= LIM; i++) {
    scanf("%lld%lld", &P[i].x, &P[i].y);
    if (!rt || (P[i].x < P[rt].x)) rt = i;
  }
  for (int i = (1), LIM = (m); i <= LIM; i++) {
    int u = sx[i], v = ty[i];
    if (Find(u) ^ Find(v)) {
      G[u].push_back(make_pair(atan2(P[v].y - P[u].y, P[v].x - P[u].x), v)),
          G[v].push_back(make_pair(atan2(P[u].y - P[v].y, P[u].x - P[v].x), u));
      F[Find(u)] = Find(v);
    }
  }
  G[rt].push_back(make_pair(3.1415926535897932384626433832795, 0));
  dfs(rt, 0);
  for (int i = (1), LIM = (n); i <= LIM; i++) {
    sort(G[i].begin(), G[i].end() - 1);
    for (int j = (0), LIM = (G[i].size() - 2); j <= LIM; j++)
      G[i][j].second = sz[G[i][j].second] + (j ? G[i][j - 1].second : 0);
  }
  int q;
  scanf("%d", &q);
  for (int S; q--;) {
    scanf("%d", &S);
    static int ar[100005];
    long long area = 0;
    for (int i = (1), LIM = (S); i <= LIM; i++) scanf("%d", &ar[i]);
    for (int i = (1), LIM = (S); i <= LIM; i++) {
      int v = i % S + 1;
      area += P[ar[i]] * P[ar[v]];
    }
    if (area < 0) reverse(ar + 1, ar + 1 + S);
    int ans = 0;
    for (int i = (1), LIM = (S); i <= LIM; i++) {
      int pr = (i + S - 2) % S + 1, sc = i % S + 1, u = ar[i];
      double pa = atan2(P[ar[pr]].y - P[ar[i]].y, P[ar[pr]].x - P[ar[i]].x),
             sa = atan2(P[ar[sc]].y - P[ar[i]].y, P[ar[sc]].x - P[ar[i]].x);
      if (pa < sa) {
        if (pa + 1e-8 < G[u].back().first && G[u].back().first < sa - 1e-8)
          ans += sz[u];
        int tl = lower_bound(G[u].begin(), G[u].end() - 1,
                             make_pair(pa + 1e-8, 0x3f3f3f3f)) -
                 G[u].begin() - 1,
            tr = lower_bound(G[u].begin(), G[u].end() - 1,
                             make_pair(sa - 1e-8, 0)) -
                 G[u].begin() - 1;
        if (tr >= 0) ans -= G[u][tr].second;
        if (tl >= 0) ans += G[u][tl].second;
      } else {
        if (pa + 1e-8 < G[u].back().first || G[u].back().first < sa - 1e-8)
          ans += sz[u];
        swap(pa, sa);
        int tl = lower_bound(G[u].begin(), G[u].end() - 1,
                             make_pair(pa - 1e-8, 0)) -
                 G[u].begin() - 1,
            tr = lower_bound(G[u].begin(), G[u].end() - 1,
                             make_pair(sa + 1e-8, 0x3f3f3f3f)) -
                 G[u].begin() - 1;
        if (G[u].size() > 1) ans -= G[u][G[u].size() - 2].second;
        if (tr >= 0) ans += G[u][tr].second;
        if (tl >= 0) ans -= G[u][tl].second;
      }
    }
    printf("%d\n", ans);
  }
}