#include <iostream>
#include <algorithm>

typedef long long ll;
typedef double lf;

// #define DEBUG 1
struct IO
{
    #define MAXSIZE (1 << 20)
    #define isdigit(x) (x >= '0' && x <= '9')
    char buf[MAXSIZE], *p1, *p2;
    char pbuf[MAXSIZE], *pp;
    #if DEBUG
    #else
    IO() : p1(buf), p2(buf), pp(pbuf) {}
    ~IO() {fwrite(pbuf, 1, pp - pbuf, stdout);}
    #endif
    #define gc() (p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, MAXSIZE, stdin), p1 == p2) ? ' ' : *p1++)
    #define blank(x) (x == ' ' || x == '\n' || x == '\r' || x == '\t')

    template <typename T>
    void Read(T &x)
    {
        #if DEBUG
        std::cin >> x;
        #else
        bool sign = 0; char ch = gc(); x = 0;
        for (; !isdigit(ch); ch = gc())
            if (ch == '-') sign = 1;
        for (; isdigit(ch); ch = gc()) x = x * 10 + (ch ^ 48);
        if (sign) x = -x;
        #endif
    }
    void Read(char *s)
    {
        #if DEBUG
        std::cin >> s;
        #else
        char ch = gc();
        for (; blank(ch); ch = gc());
        for (; !blank(ch); ch = gc()) *s++ = ch;
        *s = 0;
        #endif
    }
    void Read(char &c) {for (c = gc(); blank(c); c = gc());}

    void Push(const char &c)
    {
        #if DEBUG
        putchar(c);
        #else
        if (pp - pbuf == MAXSIZE) fwrite(pbuf, 1, MAXSIZE, stdout), pp = pbuf;
        *pp++ = c;
        #endif
    }
    template <typename T>
    void Write(T x)
    {
        if (x < 0) x = -x, Push('-');
        static T sta[35];
        int top = 0;
        do sta[top++] = x % 10, x /= 10; while (x);
        while (top) Push(sta[--top] ^ 48);
    }
    template <typename T>
    void Write(T x, char lst) {Write(x), Push(lst);}
} IO;
#define Read(x) IO.Read(x)
#define Write(x, y) IO.Write(x, y)
#define Put(x) IO.Push(x)

using namespace std;

const int MAXN = 2e5 + 10;

int n, m, q, tot;

struct Point
{
    int x, y;
    Point operator + (const Point u) const {return Point{x + u.x, y + u.y};}
    Point operator - (const Point u) const {return Point{x - u.x, y - u.y};}
    ll operator * (const Point u) const {return (ll)x * u.y - (ll)y * u.x;}
    ll length() {return (ll)x * x + (ll)y * y;}
}a[MAXN], b[MAXN], c[MAXN], d[MAXN];
inline bool cmp1(Point u, Point v) {return u.y == v.y ? u.x < v.x : u.y < v.y;}
inline bool cmp2(Point u, Point v) {ll t = u * v; return (!t ? u.length() < v.length() : t > 0);}

int st[MAXN], top;
inline void Convex(Point *p, int &n)
{
    sort(p + 1, p + n + 1, cmp1);
    Point z = p[1];
    for (int i = 1; i <= n; i++) p[i] = p[i] - z;
    sort(p + 2, p + n + 1, cmp2);
    st[top = 1] = 1;
    for (int i = 2; i <= n; i++)
    {
        while (top > 1 && (p[i] - p[st[top]]) * (p[st[top]] - p[st[top - 1]]) >= 0) top--;
        st[++top] = i;
    }
    for (int i = 1; i <= top; i++) p[i] = p[st[i]] + z;
    n = top, p[n + 1] = p[1];
}

inline void Minkowski()
{
    for (int i = 1; i <= n; i++) c[i] = a[i + 1] - a[i];
    for (int i = 1; i <= m; i++) d[i] = b[i + 1] - b[i];
    a[tot = 1] = a[1] + b[1];
    for (int i = 1, j = 1; i <= n || j <= m;)
        if (j > m || (i <= n && c[i] * d[j] >= 0)) a[tot] = a[tot++] + c[i++];
        else a[tot] = a[tot++] + d[j++];
}

inline bool Check(Point op)
{
    int pos = lower_bound(a + 1, a + tot + 1, op, cmp2) - a;
    if (pos == tot + 1 || (a[pos] - op) * (op - a[pos - 1]) < 0) return 0;
    return 1;
}

int main()
{
    // freopen("A.in", "r", stdin);
    // freopen("A.out", "w", stdout);
    #if DEBUG
    #else
    ios::sync_with_stdio(0), cin.tie(0);
    #endif
    Read(n), Read(m), Read(q);
    for (int i = 1; i <= n; i++) Read(a[i].x), Read(a[i].y);
    for (int i = 1; i <= m; i++) Read(b[i].x), Read(b[i].y), b[i].x = -b[i].x, b[i].y = -b[i].y;
    Convex(a, n), Convex(b, m);
    // for (int i = 1; i <= n; i++) cout << a[i].x << ' ' << a[i].y << '\n';
    // cout << '\n';
    // for (int i = 1; i <= m; i++) cout << b[i].x << ' ' << b[i].y << '\n';
    Minkowski(), Convex(a, tot);
    Point z = a[1], op;
    for (int i = 1; i <= tot; i++) a[i] = a[i] - z;
    while (q--)
    {
        Read(op.x), Read(op.y);
        cout << Check(op - z) << '\n';
    }
    return 0;
}