Problem: A long time ago somewhere in the depths of America existed a powerful tribe governed by the great leader Pinnie-the-Wooh. Once the tribe conquered three Maya cities. Pinnie-the-Wooh grew concerned: there had to be some control over the conquered territories. That's why he appealed to the priests of the supreme god Mogohu-Rea for help.

The priests conveyed the god's will to him: to control these three cities he should put an idol to Mogohu-Rea — that will create a religious field over the cities. However, the idol is so powerful that it can easily drive the people around it mad unless it is balanced by exactly three sacrifice altars, placed one in each city. To balance the idol the altars should be placed so that the center of mass of the system of these three points coincided with the idol. When counting the center of mass consider that all the altars have the same mass.

Now Pinnie-the-Wooh is thinking where to put the idol. He has a list of hills, that are suitable to put an idol there. Help him to identify on which of them you can put an idol without risking to fry off the brains of the cities' population with the religious field.

Each city has a shape of a convex polygon such that no three vertexes lie on a straight line. The cities can intersect. Each altar should be attached to the city through a special ceremony, besides, it must be situated on the city's territory (possibly at the border). Thus, there may be several altars on a city's territory, but exactly one of them will be attached to the city. The altars, the idol and the hills are points on the plane, some of them may coincide.

The hills are taken into consideration independently from each other, the altars' location for different hills may also be different.

Input

First follow descriptions of the three cities, divided by empty lines. The descriptions are in the following format:

The first line contains an integer n, which represent the number of the polygon's vertexes (3 ≤ n ≤ 5·104). Next n lines contain two integers xi, yi each, they are the coordinates of the polygon's i-th vertex in the counterclockwise order.

After the cities' description follows the integer m (1 ≤ m ≤ 105), which represents the number of hills. Next m lines each contain two integers xj, yj, they are the coordinates of the j-th hill.

All the coordinates in the input data do not exceed 5·108 in the absolute value.

Output

For each hill print on a single line "YES" (without the quotes) or "NO" (without the quotes), depending on whether the three sacrifice altars can be put to balance the idol or not.

Examples

Input

3
0 0
1 0
1 1

4
8 8
5 5
6 4
8 4

3
-1 -1
-3 -1
-2 -2

5
0 0
2 1
7 1
1 1
5 3


Output

NO
YES
NO
YES
NO

Note

For the hill at (2, 1) the altars can be placed at the points (1, 0), (7, 5), ( - 2, - 2), for the hill at (1, 1) — at the points (0, 0), (6, 4), ( - 3, - 1). Many other groups of three points can do the trick. There are no suitable points for other hills.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
long long int mod = 1e9 + 7;
const double error = 1e-7;
const double PI = acos(-1);
mt19937 rng(
    (unsigned int)chrono::system_clock::now().time_since_epoch().count());
inline long long int MOD(long long int x, long long int m = mod) {
  long long int y = x % m;
  return (y >= 0) ? y : y + m;
}
const int inf = 1e9 + 2;
const long long int infl = 1e18 + 1;
const int nmax = 1e5 + 5;
bool operator==(complex<long long int> p, complex<long long int> q) {
  return (p.real() == q.real()) && (p.imag() == q.imag());
}
bool lexcomp(const complex<long long int> &p, const complex<long long int> &q) {
  return make_pair(p.real(), p.imag()) < make_pair(q.real(), q.imag());
}
complex<long long int> origin, ray;
inline bool half(complex<long long int> p) {
  return ((conj(ray) * (p)).imag()) < 0 ||
         (((conj(ray) * (p)).imag()) == 0 && ((conj(ray) * (p)).real()) > 0);
}
bool polarComp(complex<long long int> p, complex<long long int> q) {
  p -= origin;
  q -= origin;
  return make_tuple(half(p), 0) < make_tuple(half(q), ((conj(p) * (q)).imag()));
}
void MinkowskiSum(vector<complex<long long int> > &A,
                  vector<complex<long long int> > &B,
                  vector<complex<long long int> > &C) {
  int n = A.size(), m = B.size();
  vector<complex<long long int> > P(n), Q(m);
  complex<long long int> st = A[0] + B[0];
  for (int i = 0; i + 1 < n; i++) P[i] = A[i + 1] - A[i];
  P[n - 1] = A[0] - A[n - 1];
  for (int i = 0; i + 1 < m; i++) Q[i] = B[i + 1] - B[i];
  Q[m - 1] = B[0] - B[m - 1];
  origin = complex<long long int>(0, 0), ray = complex<long long int>(0, -1);
  C.resize(n + m + 1);
  merge(P.begin(), P.end(), Q.begin(), Q.end(), C.begin() + 1, polarComp);
  C[0] = st;
  for (int i = 1; i < C.size(); i++) C[i] += C[i - 1];
  assert(C[0] == C.back());
  C.pop_back();
}
long long int PointInPoly(complex<long long int> p,
                          vector<complex<long long int> > &poly, int top) {
  if (lexcomp(p, poly[0]) || lexcomp(poly[top], p)) return -1;
  auto o = ((conj((poly[top]) - (poly[0])) * ((p) - (poly[0]))).imag());
  if (o == 0) {
    return (p == poly[0] || p == poly[top] || top == 1 ||
            top + 1 == poly.size())
               ? 0
               : 1;
  } else if (o < 0) {
    auto it = lower_bound(poly.begin(), poly.begin() + top, p, lexcomp);
    return ((conj((it[0]) - (it[-1])) * ((p) - (it[-1]))).imag());
  } else {
    auto it = upper_bound(poly.rbegin(), poly.rend() - top - 1, p, lexcomp);
    return ((conj((it[0]) - (p)) *
             (((it == poly.rbegin()) ? poly[0] : it[-1]) - (p)))
                .imag());
  }
}
vector<complex<long long int> > poly[3], sum;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  ;
  for (int i = 0; i < 3; i++) {
    int n;
    cin >> n;
    poly[i].resize(n);
    for (int j = 0; j < n; j++) {
      long long int x, y;
      cin >> x >> y;
      poly[i][j] = complex<long long int>(x, y);
    }
    auto it = min_element(poly[i].begin(), poly[i].end(), lexcomp);
    rotate(poly[i].begin(), it, poly[i].end());
  }
  MinkowskiSum(poly[0], poly[1], sum);
  MinkowskiSum(sum, poly[2], sum);
  int top = max_element(sum.begin(), sum.end(), lexcomp) - sum.begin();
  int m;
  cin >> m;
  for (int i = 0; i < m; i++) {
    long long int x, y;
    cin >> x >> y;
    complex<long long int> p(x, y);
    p *= 3;
    if (PointInPoly(p, sum, top) < 0)
      cout << "NO\n";
    else
      cout << "YES\n";
  }
}