#include <bits/stdc++.h>

using namespace std;

struct Point {
    int X, Y;
    Point() { X = 0; Y = 0; }
    Point(int x, int y) { X = x; Y = y; }
    Point operator - (Point p) { return Point(X - p.X, Y - p.Y); }
};

int sign(long long n) { return (n > 0) - (n < 0); }
long long cross(Point a, Point b) { return a.X * b.Y - a.Y * b.X; }
long long cross(Point a, Point b, Point c) { return cross(b - a, c - a); }
int orientation(Point a, Point b, Point c) { return sign(cross(a, b, c)); }

bool segments_intersect(Point A, Point B, Point C, Point D) { return orientation(A, B, C) != orientation(A, B, D) && orientation(C, D, A) != orientation(C, D, B); }
bool in_triangle(Point P, Point A, Point B, Point C) {
    if(orientation(P, A, B) == 0) return orientation(P, B, C) == orientation(P, C, A);
    if(orientation(P, B, C) == 0) return orientation(P, C, A) == orientation(P, A, B);
    if(orientation(P, C, A) == 0) return orientation(P, A, B) == orientation(P, B, C);
    return orientation(P, A, B) == orientation(P, B, C) && orientation(P, B, C) == orientation(P, C, A);
}

struct edge {
    int u;
    int v;
};

const int N = 105;
int n, m, e;
Point a[N], b[N];
edge edges[3 * N];
bool connected[N][N], fake[N][N];
vector<int> faces[N][N];
int id = 0;
int face[N];
vector<int> g[N];
bool target[N];
bool mark[N];

bool dfs(int u) {
    if(target[u]) return true;
    if(mark[u]) return false;
    mark[u] = true;
    bool ans = false;
    for(int v : g[u]) {
        if(mark[v]) continue;
        ans |= dfs(v);
    }
    return ans;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cin >> n >> m >> e;
    for(int i = 0; i < n; i++) cin >> a[i].X >> a[i].Y;
    for(int i = 0; i < m; i++) cin >> b[i].X >> b[i].Y;
    for(int i = 0; i < e; i++) {
        cin >> edges[i].u >> edges[i].v;
        edges[i].u--;
        edges[i].v--;
        connected[edges[i].u][edges[i].v] = connected[edges[i].v][edges[i].u] = true;
    }
    for(int i = 0; i < n; i++) {
        for(int j = i + 1; j < n; j++) {
            if(connected[i][j]) continue;
            bool ok = true;
            for(int i2 = 0; i2 < n; i2++) {
                if(i2 == i || i2 == j) continue;
                for(int j2 = i2 + 1; j2 < n; j2++) {
                    if(j2 == i || j2 == j) continue;
                    if(!connected[i2][j2]) continue;
                    if(segments_intersect(a[i], a[j], a[i2], a[j2])) {
                        ok = false;
                        break;
                    }
                }
                if(!ok) break;
            }
            if(ok) connected[i][j] = connected[j][i] = fake[i][j] = fake[j][i] = true;
        }
    }
    for(int x = 0; x < n; x++) {
        for(int y = x + 1; y < n; y++) {
            for(int z = y + 1; z < n; z++) {
                if(!connected[x][y] || !connected[y][z] || !connected[x][z]) continue;
                bool ok = true;
                for(int i = 0; i < n; i++) {
                    if(i == x || i == y || i == z) continue;
                    if(in_triangle(a[i], a[x], a[y], a[z])) {
                        ok = false;
                        break;
                    }
                }
                if(!ok) continue;
                id++;
                faces[x][y].push_back(id);
                faces[x][z].push_back(id);
                faces[y][z].push_back(id);
                faces[y][x].push_back(id);
                faces[z][x].push_back(id);
                faces[z][y].push_back(id);
                ok = false;
                for(int i = 0; i < m; i++) {
                    if(in_triangle(b[i], a[x], a[y], a[z])) {
                        face[i] = id;
                        target[id] = true;
                        ok = true;
                        break;
                    }
                }
                if(!ok) target[0] = true;
            }
        }
    }
    for(int i = 0; i < n; i++) {
        for(int j = i + 1; j < n; j++) {
            if(faces[i][j].size() == 1) {
                faces[i][j].push_back(0);
                faces[j][i].push_back(0);
            }
            if(fake[i][j]) {
                g[faces[i][j][0]].push_back(faces[i][j][1]);
                g[faces[i][j][1]].push_back(faces[i][j][0]);
            }
        }
    }
//    for(int i = 0; i < n; i++) {
//        for(int j = i + 1; j < n; j++) {
//            if(connected[i][j]) {
//                cout << i << " " << j << ": " << faces[i][j][0] << " " << faces[i][j][1] << "\n";
//            }
//        }
//    }
    for(int i = 0; i < e; i++) {
        bool ok = false;
        for(int j = 0; j < N; j++) mark[j] = false;
//        cout << i << ": " << faces[edges[i].u][edges[i].v][0] << " " << faces[edges[i].u][edges[i].v][1] << "\n";
        ok |= dfs(faces[edges[i].u][edges[i].v][0]);
        for(int j = 0; j < N; j++) mark[j] = false;
        ok |= dfs(faces[edges[i].u][edges[i].v][1]);
        cout << ok;
    }
    return 0;
}
/*

4 1 3
-2 0
0 2
2 0
0 1
0 3
1 2
2 3
1 3

*/