#include "bits/stdc++.h"
using namespace std;

#define FOR(i,a,b) for (int i = (a) ; i < (b); i++)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); i--)
#define R0F(i,a) ROF(i,0,a)

#define ar array
#define all(v) begin(v),end(v)
#define sz(v) static_cast<int>(v.size())
typedef vector<int> vi;
typedef long long ll;

struct Point {
	ll x,y;
	bool operator==(const Point& p) const { return (x == p.x && y == p.y); }
	Point operator-(const Point &p) const { return {x-p.x,y-p.y}; }
	Point operator+(const Point &p) const { return {x+p.x,y+p.y}; }
	friend ll abs(const Point& a) { return a.x*a.x+a.y*a.y; }
	friend ll cross(const Point &a, const Point &b) { return a.x*b.y-a.y*b.x; }
	friend ll cross(const Point& p, const Point& a, const Point& b) { return cross(a-p,b-p); }
};
bool hCmp(const Point& p, const Point& q) {
	return p.y < q.y || (p.y == q.y && p.x < q.x);
}
bool angleCmp(const Point& p, const Point& q) {
	return cross(p,q) > 0 || (cross(p,q) == 0 && abs(p) < abs(q));
}
vector<Point> graham(vector<Point> p) {
	sort(all(p),hCmp);
	Point base = p[0];
	for (Point &a : p) a = a-base;
	sort(1+all(p),angleCmp);
	vector<Point> h;
	for (Point a : p) {
		while (sz(h) > 1 && cross(h[sz(h)-2],h[sz(h)-1],a) <= 0) h.pop_back();
		h.push_back(a);
	}
	for (Point &a : h) a = a+base;
	return h;
}
vector<Point> minkowski(vector<Point> p, vector<Point> q) {
	vector<Point> sp(sz(p)), sq(sz(q));
	F0R(i,sz(p)) sp[i] = p[(i+1)%sz(p)]-p[i];
	F0R(i,sz(q)) sq[i] = q[(i+1)%sz(q)]-q[i];
	vector<Point> h = {p[0]+q[0]};
	int i = 0, j = 0;
	while (i < sz(p) && j < sz(q)) h.push_back(h.back()+(cross(sp[i],sq[j]) >= 0 ? sp[i++] : sq[j++]));
	while (i < sz(p)) h.push_back(h.back()+sp[i++]);
	while (j < sz(q)) h.push_back(h.back()+sq[j++]);
	return h;
}
bool inside(vector<Point> &h, Point p) {
	if (cross(p,h[0]) > 0 || cross(h.back(),p) > 0) return 0;
	int i = lower_bound(all(h),p,angleCmp)-begin(h)-1;
	return cross(h[i],p,h[(i+1)%sz(h)]) <= 0;
}

int32_t main() {
	ios::sync_with_stdio(false); cin.tie(NULL);
	cin.exceptions(cin.failbit);
	int n, m, q;
	cin >> n >> m >> q;
	vector<Point> tp(n), tq(m);
	for (Point &a : tp) cin >> a.x >> a.y;
	for (Point &a : tq) cin >> a.x >> a.y, a.x *= -1, a.y *= -1;
	auto h = graham(minkowski(graham(tp),graham(tq)));
	Point base = h[0];
	for (Point &a : h) a = a-base;
	while (q--) {
		Point p;
		cin >> p.x >> p.y;
		p = p-base;
		cout << inside(h,p) << '\n';
	}
}