#include<bits/stdc++.h>
using namespace std;
#define int long long
#define f first
#define s second
const int N = 110;
const int M = 1e4 + 69; //ko ce racunati ovo?
struct point {
	int x, y;
} a[N], b[N];
int n, m, e, c[N], ans[N]; //kom nodu pripada
vector<int> g[M], f[M];
vector<int> t[M];
int edge[N][N];
int cross(point a, point b, point c) {
	int r = (c.x - a.x) * (b.y - a.y) - (c.y - a.y) * (b.x - a.x);
	if (r > 0)
		return 1; //desno
	else if (r < 0)
		return -1; //levo
	return 0;
}
bool inter(point a, point b, point c, point d) {
	for (int i = 0;i < 2;i++) {
		if (cross(a, b, c) == cross(a, b, d) || cross(a, b, c) == 0 || cross(a, b, d) == 0)
			return false;
		swap(a, c);
		swap(b, d);
	}
	return true;
}
signed main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
  int tt = 1;
  //cin >> tt;
  while (tt--) {
    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;
    }
    vector<pair<int, int>> edges(e);
    for (int i = 0;i < e;i++) {
    	cin >> edges[i].f >> edges[i].s;
    	edge[edges[i].f][edges[i].s] = i + 1;
    	edge[edges[i].s][edges[i].f] = i + 1;
    	if (edges[i].f > edges[i].s)
    		swap(edges[i].f, edges[i].s);
    }
    for (int i = 1;i <= n;i++) {
    	for (int j = i + 1;j <= n;j++) {
    		if (edge[i][j])
    			continue;
    		int o = 1;
    		for (auto u : edges) 
    			o &= (!inter(a[i], a[j], a[u.f], a[u.s]));
    		if (o) {
    			edges.push_back({i, j});
    			edge[i][j] = edge[j][i] = (int)edges.size(); //fake edges
    		}
    	}
    }
    int node = 1;
   	for (int i = 1;i <= n;i++) {
   		for (int j = i + 1;j <= n;j++) {
   			for (int k = j + 1;k <= n;k++) {
   				if (!edge[i][j] || !edge[i][k] || !edge[j][k])
   					continue;
   				int id = edge[i][j], id2 = edge[i][k], id3 = edge[j][k];
   				int o = 0;
   				for (int x = 1;x <= n;x++) {
   					int p = cross(a[i], a[j], a[x]);
   					int p1 = cross(a[k], a[i], a[x]);
   					int p2 = cross(a[j], a[k], a[x]);
						o |= (p == p1 && p1 == p2);
   				}
   				if (o)
   					continue;
   				t[node].push_back(id);
   				t[node].push_back(id2);
   				t[node].push_back(id3);
   				f[id].push_back(node);
   				f[id2].push_back(node);
   				f[id3].push_back(node);
   				for (int x = 1;x <= m;x++) {
   					int p = cross(a[i], a[j], b[x]);
   					int p1 = cross(a[k], a[i], b[x]);
   					int p2 = cross(a[j], a[k], b[x]);
						if (p == p1 && p1 == p2) {
							c[x] = node;
						}
   				}
   				++node;
   			}
   		}
   	}
   	//> e su fake edgevi
   	int cnt = 0;
   	for (int i = 1;i <= m;i++) {
   		if (c[i] == 0) {
   			c[i] = node;
   			cnt++;
   		}
   	}
   	if (cnt) {
	   	for (int i = 1;i < node;i++) {
	   		int o = 0;
	   		for (auto u : t[i]) {
	   			o |= (f[u].size() == 1);
	   		}
	   		if (o) {
	   			g[node].push_back(i);
	   			g[i].push_back(node);
	   		}
	   	}
   	}
   	for (int i = 1;i < node;i++) {
   		for (int j = i + 1;j < node;j++) {
   			for (auto u : t[i]) {
   				if (u > e) {
   					for (auto x : t[j]) {
   						if (x == u) {
   							g[i].push_back(j);
   							g[j].push_back(i);
   						}
   					}
   				}
   			}
   		}
   	}
   	for (int i = 1;i <= m;i++) {
			vector<int> vis(node + 1);
			function<void(int)> dfs = [&](int v) {
				if (vis[v])
					return;
				vis[v] = 1;
				for (auto u : g[v])
					dfs(u);
			};
			dfs(c[i]);
			for (int j = 1;j <= node;j++) {
				if (vis[j]) {
					for (auto u : t[j]) {
						ans[u] = 1;
					}
				}
			}
   	}
   	for (int i = 1;i <= e;i++)
   		cout << ans[i];
  }
  return 0;
}