#include<bits/stdc++.h>
using ll = long long;
using std::cin;
using std::cout;
const int N = 200005;

struct vec2 { ll x, y; } a[N], b[N];
ll operator * (vec2 x, vec2 y) { return x.x * y.y - x.y * y.x; }
vec2 operator + (vec2 x, vec2 y) { return {x.x + y.x, x.y + y.y}; }
vec2 operator - (vec2 x, vec2 y) { return {x.x - y.x, x.y - y.y}; }
int half(vec2 x) { return x.y < 0 || (x.y == 0 && x.x <= 0); }
int cmp(vec2 a, vec2 b) { return half(a) == half(b) ? a * b > 0 : half(b); }

int n, m, e;
using pr = std::pair<int, int>;
std::vector<pr> edge[N];
int anc[N];
int ok[N];
vec2 start[N];
int find(int x) {
	return anc[x] == x ? x : anc[x] = find(anc[x]);
}
int go[N];
void un(int x, int y) {
	go[x] = y;
	anc[find(x)] = find(y);
}
std::vector<pr> v;
int vis[N];
int contain(std::vector<vec2> a, vec2 o) { bool in = 0;
	for(int i = 0;i < (int) a.size();++i) {
		vec2 x = a[i] - o, y = a[(i + 1) % a.size()] - o;
		if(!x.x && !x.y) return 0;
		if(x.y > y.y) std::swap(x, y);
		if(x.y <= 0 && y.y > 0 && x * y < 0) in ^= 1;
	}
	return in;
}

int main() {
	std::ios::sync_with_stdio(false), cin.tie(0);
	cin >> n >> m >> e;
	for(int i = 1;i <= n;++i) {
		cin >> a[i].x >> a[i].y;
	}
	for(int i = 1;i <= m;++i) {
		cin >> b[i].x >> b[i].y;
	}
	for(int i = 1;i <= e * 2 + 1;++i) anc[i] = i;
	for(int i = 1, x, y;i <= e;++i) {
		cin >> x >> y;
		edge[x].emplace_back(y, i * 2 + 0);
		edge[y].emplace_back(x, i * 2 + 1);
		start[i * 2] = a[x];
		start[i * 2 + 1] = a[y];
		v.emplace_back(x, y);
	}
	for(int i = 1;i <= n;++i) {
		sort(edge[i].begin(), edge[i].end(), [&](pr x, pr y) {
			vec2 u = a[x.first] - a[i];
			vec2 v = a[y.first] - a[i];
			return cmp(u, v);
		});
		auto edge = ::edge[i];
		for(int i = 0;i < (int) edge.size();++i) {
			un(edge[i].second ^ 1, edge[(i + 1) % edge.size()].second);
		}
	}
	std::vector<int> out;
	std::vector<std::pair<std::vector<vec2>, int>> A, B;
	for(int i = 2;i <= e * 2 + 1;++i) if(!vis[i]) {
		int j = go[i];
		vis[i] = 1;
		std::vector<vec2> ss = {start[i]};
		for(;j != i;j = go[j]) {
			vis[j] = 1;
			ss.push_back(start[j]);
		}
		reverse(ss.begin(), ss.end());
		ll sum = 0;
		for(int i = 2;i < (int) ss.size();++i) {
			sum += (ss[i - 1] - ss[0]) * (ss[i] - ss[0]);
		}
		if(sum >= 0) {
			B.emplace_back(ss, i);
		} else {
			A.emplace_back(ss, i);
		}
	}
	auto area = [&](const std::vector<vec2> & ss) {
		ll sum = 0;
		for(int i = 2;i < (int) ss.size();++i) {
			sum += (ss[i - 1] - ss[0]) * (ss[i] - ss[0]);
		}
		return sum < 0 ? -sum : sum;
	};
	sort(A.begin(), A.end(), [&](auto x, auto y) {
		return area(x.first) < area(y.first);
	});
	for(auto [b, bid] : B) {
		int id = -1;
		for(auto [ss, ID] : A) {
			int ok = 1;
			for(auto x : b) {
				ok = ok && contain(ss, x);
			}
			if(ok) {
				id = ID;
				break;
			}
		}
		if(id > 0) {
			un(bid, id);
		} else {
			out.push_back(bid);
		}
	}
	for(int i = 1;i < (int) out.size();++i) {
		un(out[i - 1], out[i]);
	}
	for(int i = 1;i <= m;++i) {
		int seted = 0;
		for(int j = 0;j < e;++j) {
			for(auto [ss, ID] : A) {
				if(contain(ss, b[i])) {
					ok[find(ID)] = 1;
					seted = 1;
					break;
				}
			}
		}
		if(!seted) {
			for(int x : out) ok[find(x)] = 1;
		}
	}
	for(int i = 1;i <= e;++i) {
		if(ok[find(i * 2)] || ok[find(i * 2 + 1)]) {
			cout.put(1 + 48);
		} else {
			cout.put(0 + 48);
		}
	}
}