#include<iostream>

#include<cstdio>

#include<algorithm>

#include<cstring>

#include<cmath>

using namespace std;

typedef long long ll;

typedef double db;

inline int read()

{

    int x=,f=; char ch=getchar();

    while(ch<''||ch>'') { if(ch=='-') f=-; ch=getchar(); }

    while(ch>=''&&ch<='') { x=(x<<)+(x<<)+(ch^); ch=getchar(); }

    return x*f;

}

const int N=2e5+;

struct poi {

    ll x,y;

    poi (ll a=,ll b=) { x=a,y=b; }

    inline poi operator + (const poi &tmp) const { return poi(x+tmp.x,y+tmp.y); }

    inline poi operator - (const poi &tmp) const { return poi(x-tmp.x,y-tmp.y); }

    inline bool operator < (const poi &tmp) const { return x!=tmp.x ? x<tmp.x : y<tmp.y; }

}A[N],B[N],C[N],st[N],sum;

inline ll Cross(poi A,poi B) { return A.x*B.y-A.y*B.x; }

inline db Dot(poi A,poi B) { return A.x*B.x+A.y*B.y; }

inline db Len(poi A) { return sqrt(Dot(A,A)); }

inline bool cmp(const poi &A,const poi &B) { return Cross(A,B)>||(Cross(A,B)==&&Len(A)<Len(B)); }

void Tubao(poi *P,int &tot)

{

    sort(P+,P+tot+); sum=sum+P[];/*如果此时求的是C的凸包P[1]=(0,0)没有贡献*/ for(int i=tot;i>=;i--) P[i]=P[i]-P[];

    sort(P+,P+tot+,cmp); int Top=;

    for(int i=;i<=tot;st[++Top]=P[i],i++)

        while(Top> && Cross(P[i]-st[Top-],st[Top]-st[Top-])>= ) Top--;

    tot=Top; for(int i=;i<=tot;i++) P[i]=st[i];

}

int check(poi *P,int tot,poi A)

{

    A=A-sum;

    if(Cross(A,P[])>||Cross(P[tot],A)>) return ;

    int pos=lower_bound(P+,P+tot+,A,cmp)-P-; if(pos==tot) return ;

    return Cross(A-P[pos],P[pos+]-P[pos])<=;

}

int n,m,T,Q;

int main()

{

    n=read(),m=read(),Q=read();

    for(int i=;i<=n;i++) A[i].x=read(),A[i].y=read();

    for(int i=;i<=m;i++) B[i].x=-read(),B[i].y=-read();

    Tubao(A,n); Tubao(B,m);

    int la=,lb=; C[++T]=A[]+B[];

    while(la<=n||lb<=m)

    {

        poi p1=A[la%n+]+B[(lb-)%m+],p2=A[(la-)%n+]+B[lb%m+];

        if(Cross(p1-C[T],p2-C[T])>=) la++,C[++T]=p1;

        else lb++,C[++T]=p2;

    }

    Tubao(C,T);

    for(int i=;i<=Q;i++)

    {

        int x=read(),y=read();

        printf("%d\n",check(C,T,poi(x,y)));

    }

    return ;

}