#include <bits/stdc++.h>
using namespace std;
struct pt {
  long long x, y;
  pt() {}
  pt(long long px, long long py) : x(px), y(py) {}
  void get() { scanf("%lld%lld", &x, &y); }
};
pt operator+(const pt& a, const pt& b) { return pt(a.x + b.x, a.y + b.y); }
pt operator-(const pt& a, const pt& b) { return pt(a.x - b.x, a.y - b.y); }
long long operator^(const pt& a, const pt& b) { return a.x * b.y - a.y * b.x; }
vector<pt> sum(vector<pt>& a, vector<pt>& b) {
  vector<pt> c;
  int li = 0, lj = 0;
  int n = a.size(), m = b.size();
  for (auto i = 1; i != n; i++)
    if (a[i].y < a[li].y || (a[i].y == a[li].y && a[i].x < a[li].x)) li = i;
  for (auto j = 1; j != m; j++)
    if (b[j].y < b[lj].y || (b[j].y == b[lj].y && b[j].x < b[lj].x)) lj = j;
  rotate(a.begin(), a.begin() + li, a.end());
  rotate(b.begin(), b.begin() + lj, b.end());
  a.push_back(a[0]);
  b.push_back(b[0]);
  a.push_back(a[1]);
  b.push_back(b[1]);
  int i = 0, j = 0;
  while (i < n || j < m) {
    c.push_back(a[i] + b[j]);
    if (((a[i + 1] - a[i]) ^ (b[j + 1] - b[j])) > 0)
      i++;
    else if (((a[i + 1] - a[i]) ^ (b[j + 1] - b[j])) < 0)
      j++;
    else {
      i++;
      j++;
    }
  }
  return c;
}
int n, m, k;
vector<pt> a, b, c, s, t;
void prepare() {
  n = s.size();
  int li = 0;
  for (auto i = 1; i != n; i++)
    if (s[i].x < s[li].x || (s[i].x == s[li].x && s[i].y < s[li].y)) li = i;
  rotate(s.begin(), s.begin() + li, s.end());
}
bool inside(pt p) {
  if (p.x == s[0].x && p.y == s[0].y) return true;
  if (((s[n - 1] - s[0]) ^ (p - s[0])) > 0) return false;
  if (((p - s[0]) ^ (s[1] - s[0])) > 0) return false;
  int l = 1, r = n - 1;
  while (r - l > 1) {
    int mid = (l + r) >> 1;
    if (((s[mid] - s[0]) ^ (p - s[0])) > 0)
      l = mid;
    else
      r = mid - 1;
  }
  if (((s[r] - s[0]) ^ (p - s[0])) > 0) l = r;
  long long la = s[l + 1].y - s[l].y;
  long long lb = s[l].x - s[l + 1].x;
  long long lc = -la * s[l].x - lb * s[l].y;
  long long f0 = la * s[0].x + lb * s[0].y + lc;
  long long fp = la * p.x + lb * p.y + lc;
  if (f0 < 0 && fp > 0) return false;
  if (f0 > 0 && fp < 0) return false;
  return true;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  scanf("%d", &n);
  a.resize(n);
  for (auto i = 0; i != n; i++) a[i].get();
  scanf("%d", &m);
  b.resize(m);
  for (auto i = 0; i != m; i++) b[i].get();
  scanf("%d", &k);
  c.resize(k);
  for (auto i = 0; i != k; i++) c[i].get();
  t = sum(a, b);
  s = sum(t, c);
  prepare();
  int q;
  scanf("%d", &q);
  for (auto i = 0; i != q; i++) {
    pt p;
    p.get();
    p.x *= 3;
    p.y *= 3;
    if (inside(p))
      printf("YES\n");
    else
      printf("NO\n");
  }
  return 0;
}
