/*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=1e3+5;
const ll maxlg=__lg(maxn)+2;
const ll INF64=4e18;
const int INF=0x3f3f3f3f;
const int MOD=1e9+7;
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;
}
struct P{
    ll x,y;
    P(ll x=0,ll y=0):x(x),y(y){}
    void read(){
        cin>>x>>y;
    }
    ll operator *(const P &b) const{
        return (ll)x*b.y-(ll)y*b.x;
    }
    P operator -(const P &b) const{
        return P{x-b.x,y-b.y};
    }
    void operator -=(const P&b){
        x-=b.x,y-=b.y;
    }
    ll triangle(const P&b,const P&c) const{
        return (b-*this)*(c-*this);
    }
    int ori(const P&a,const P&b) const{
        P z=*this;
        ll x=(a-z)*(b-z);
        if(x<0) return -1;
        if(x>0) return 1;
        return 0;
    }
    bool operator < (const P&b) const{
        return make_pair(x,y)<make_pair(b.x,b.y);
    }
};
ll dot(P a,P b){
    return a.x*b.x+a.y*b.y;
}
vector<P> hull(vector<P> &arr){
    sort(ALL(arr));
    int n=sz(arr);
    vector<P> v;
    REP(j,2){
        const int S=sz(v)+2;
        for(int i=0;i<n;i++){
            //if remove collinear points change to >=0
            while(sz(v)>=S and v[sz(v)-2].triangle(v[sz(v)-1],arr[i])>=0){
                v.pop_back();
            }
            v.push_back(arr[i]);
        }
        v.pop_back();
        reverse(ALL(arr));
    }
    return v; 
}
bool inter(P p1,P p2,P p3,P p4){
    if((p2-p1)*(p4-p3)==0){
        //parallel
        if((p2-p1)*(p3-p1)!=0){
            return false;
        }
        REP(i,2){
            if(max(p1.x,p2.x)<min(p3.x,p4.x) or max(p1.y,p2.y)<min(p3.y,p4.y)){
                return false;
            }
            swap(p1,p3),swap(p2,p4);
        }
        return true;
    }
    REP(i,2){
        int a=p1.ori(p2,p3),b=p1.ori(p2,p4);
        if(a==b){
            return false;
        }
        swap(p1,p3);
        swap(p2,p4);
    }
    return true;
}
int main(){
    ios::sync_with_stdio(false),cin.tie(0);
    int n,m,q;
    cin>>n>>m>>q;
    vector<P> a(n),b(m);
    REP(i,n) a[i].read();
    REP(i,m) b[i].read();
    a=hull(a),b=hull(b);
    n=sz(a),m=sz(b);
    while(q--){
        int dx,dy;
        cin>>dx>>dy;
        bool hv=0;
        for(auto &x:b) x.x+=dx,x.y+=dy;
        REP(i,n){
            REP(j,m){
                if(inter(a[i],a[(i+1)%n],b[j],b[(j+1)%m])){
                    hv=1;
                    break;
                }
            }
            if(hv) break;
        }
        for(auto &x:b) x.x-=dx,x.y-=dy;
        cout<<hv<<'\n';
    }
}