/*input
4 4 3
0 0
1 0
0 1
1 1
-1 0
0 3
0 2
0 -1
0 0
2 3
0 -1

*/
#include<bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> indexed_set;
//#pragma GCC target("avx2")
//order_of_key #of elements less than x
// find_by_order kth element
using ll=long long;
using ld=long double;
using pii=pair<int,int>;
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()),c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
const ll maxn=4e5+5;
const ll maxlg=__lg(maxn)+2;
const ll INF64=4e18;
const int INF=0x3f3f3f3f;
const int MOD=998244353;
const ld PI=acos(-1);
const ld eps=1e-4;
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
template<typename T1,typename T2>
ostream& operator<<(ostream& out,pair<T1,T2> P){
    out<<P.f<<' '<<P.s;
    return out;
}
template<typename T>
ostream& operator<<(ostream& out,vector<T> V){
    REP(i,sz(V)) out<<V[i]<<((i!=sz(V)-1)?",":"");
    return out;
}
ll mult(ll a,ll b){
    return a*b%MOD;
}
ll mypow(ll a,ll b){
    a%=MOD;
    if(a==0) return 0;
    if(b<=0) return 1;
    ll res=1LL;  
    while(b){
        if(b&1) res=(res*a)%MOD;
        a=(a*a)%MOD;
        b>>=1;
    }
    return res;
}
#define ll long long
inline int read(){
    char ch=getchar();
    int res=0,f=1;
    while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
    while(isdigit(ch))res=(res+(res<<2)<<1)+(ch^48),ch=getchar();
    return res*f;
}
const int N=100005;
struct point{
    double x,y;
    point(double _x=0,double _y=0):x(_x),y(_y){}
    friend inline point operator +(const point &a,const point &b){
        return point(a.x+b.x,a.y+b.y);
    }
    friend inline point operator -(const point &a,const point &b){
        return point(a.x-b.x,a.y-b.y);
    }
    friend inline double operator *(const point &a,const point &b){
        return a.x*b.y-a.y*b.x; 
    }
    inline double calc(){
        return x*x+y*y;
    }
}p1[N],p2[N],q[N],t1[N],t2[N];
int n,m,k,top;
inline bool comp(const point &a,const point &b){
    double res=(a-q[1])*(b-q[1]);
    return (res==0)?((a-q[1]).calc()<(b-q[1]).calc()):(res>0);
}
int graham(point *p,int cnt)
{
    for(int i=1;i<=cnt;i++)q[i]=p[i];
    for(int i=2;i<=cnt;i++)if(q[i].x<q[1].x||q[i].x==q[1].x&&q[i].y<q[1].y)swap(q[1],q[i]);
    sort(q+2,q+cnt+1,comp);top=1;
    for(int i=2;i<=cnt;i++)
    {
        while(top>=2&&(q[top]-q[top-1])*(q[i]-q[top-1])<=0)top--;
        q[++top]=q[i];
    }
    for(int i=1;i<=top;i++)p[i]=q[i];p[top+1]=p[1];
    return top;
}
point p[N];int tot;
inline int check(point a){
    if((a-p[1])*(p[2]-p[1])>0||(a-p[1])*(p[tot]-p[1])<0)return 0;
    int l=2,r=tot,res=2;
    while(l<=r){
        int mid=((l+r)>>1);
        if((p[mid]-p[1])*(a-p[1])>=0)res=mid,l=mid+1;
        else r=mid-1;
    }
    return (p[res%tot+1]-p[res])*(a-p[res])>=0;
}
int main(){
    n=read(),m=read(),k=read();
    for(int i=1;i<=n;i++)p1[i].x=read(),p1[i].y=read();
    for(int i=1;i<=m;i++)p2[i].x=-read(),p2[i].y=-read();
    n=graham(p1,n),m=graham(p2,m);
    for(int i=1;i<=n;i++)t1[i]=p1[i+1]-p1[i];
    for(int i=1;i<=m;i++)t2[i]=p2[i+1]-p2[i];
    int f1=1,f2=1;p[tot=1]=p1[1]+p2[1];
    while(f1<=n&&f2<=m)p[++tot]=p[tot-1]+((t1[f1]*t2[f2]>=0)?t1[f1++]:t2[f2++]);
    while(f1<=n)p[++tot]=p[tot-1]+t1[f1++];
    while(f2<=m)p[++tot]=p[tot-1]+t2[f2++];
    tot=graham(p,tot);
    while(k--){
        point a;a.x=read(),a.y=read();
        cout<<check(a)<<'\n' ;
    }
}