#include <bits/stdc++.h>

#define ll long long
#define ld long double
#define pb push_back
#define fi first
#define se second
#define en '\n'
#define sp ' '
#define tb '\t'
#define ri(n) int n; cin >> n
#define rl(n) ll n; cin >> n
#define rs(s) string s; cin >> s
#define rc(c) char c; cin >> c
#define rv(v) for (auto &x : v) cin >> x
#define pven(v) for (auto x : v) cout << x << en
#define pv(v) for (auto x : v) cout << x << sp; cout << en
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define yes cout << "YES" << en
#define no cout << "NO" << en
#define smin(a, b) a = min(a, b)
#define smax(a, b) a = max(a, b)
#define ssort(a, b) if (a < b) swap(a, b)
#define bitcnt(a) (__builtin_popcountll(a))
#define bithigh(a) (63-__builtin_clzll(a))
#define lg bithigh
#define highpow(a) (1LL << (ll)lg(a))

using namespace std;

struct Point{

    ll x, y;
    Point(ll x = 0, ll y = 0){ this->x = x; this->y = y; }
    void Read(){ cin >> x >> y; }

    Point operator+(const Point& a) const { return Point(x + a.x, y + a.y); }
    Point operator-(const Point& a) const { return Point(x - a.x, y - a.y); }
    ll operator*(const Point& a) const { return x*a.y - a.x*y; }

    static int sig(ll x){ return x / max(abs(x), 1LL); }

    static bool Intersect(array<Point, 2> a, array<Point, 2> b){
        int o1 = sig((a[1] - a[0]) * (b[0] - a[1])) * sig((a[1] - a[0]) * (b[1] - a[1]));
        int o2 = sig((b[1] - b[0]) * (a[0] - b[1])) * sig((b[1] - b[0]) * (a[1] - b[1]));
        return o1 == -1 && o2 == -1;
    }

    bool Inside(Point a, Point b, Point c) const {
        set<int> s;
        s.insert(sig((b - a) * (*this - b)));
        s.insert(sig((c - b) * (*this - c)));
        s.insert(sig((a - c) * (*this - a)));
        s.erase(0);
        return s.size() == 1;
    }
};

const ll LINF = 4e18;
const int mxN = 110, INF = 2e9;
ll N, C, n, m, e, e1, comp[mxN*mxN];
Point p[mxN], q[mxN];
array<int, 2> E[mxN], E1[mxN*mxN];
array<int, 3> faces[mxN*mxN];
vector<int> g[mxN*mxN];
bool connected[mxN][mxN], vis[mxN*mxN], has[mxN*mxN];

void AddEdge(int u, int v){
    g[u].pb(v);
    g[v].pb(u);
}

void dfs(int s, int c){

    comp[s] = c;
    vis[s] = 1;
    for (int u : g[s])
        if (!vis[u]) dfs(u, c);
}

void Solve(){

    cin >> n >> m >> e;
    for (int i = 0; i < n; i++)
        p[i].Read();
    for (int i = 0; i < m; i++)
        q[i].Read();
    for (int i = 0; i < e; i++){
        cin >> E[i][0] >> E[i][1];
        E[i][0]--;
        E[i][1]--;
        connected[E[i][0]][E[i][1]] = 1;
        connected[E[i][1]][E[i][0]] = 1;
    }
    for (int i = 0; i < n; i++){
        for (int j = i+1; j < n; j++){
            if (!connected[i][j]){
                bool f = 1;
                for (int k = 0; k < n; k++)
                    for (int l = k+1; l < n; l++)
                        if (i^k && j^k && i^l && j^l && connected[k][l] && Point::Intersect({p[i], p[j]}, {p[k], p[l]}))
                            f = 0;
                if (f){
                    connected[i][j] = 1;
                    connected[j][i] = 1;
                    E1[e1++] = {i, j};
                }
            }
        }
    }
    for (int i = 0; i < n; i++){
        for (int j = i+1; j < n; j++){
            if (connected[i][j]){
                for (int k = j+1; k < n; k++){
                    if (connected[i][k] && connected[j][k]){
                        bool f = 1;
                        for (int l = 0; l < n; l++)
                            if (l^i && l^j && l^k && p[l].Inside(p[i], p[j], p[k]))
                                f = 0;
                        if (f) faces[N++] = {i, j, k};
                    }
                }
            }
        }
    }
    for (int i = 0; i < e1; i++){
        vector<int> idx;
        for (int j = 0; j < N; j++){
            int cnt = 0;
            for (int k = 0; k < 3; k++)
                if (faces[j][k] == E1[i][0] || faces[j][k] == E1[i][1])
                    cnt++;
            if (cnt == 2) idx.pb(j);
        }
        if (idx.size() == 1) idx.pb(N);
        AddEdge(idx[0], idx[1]);
    }
    for (int i = 0; i <= N; i++)
        if (!vis[i]) dfs(i, C++);
    for (int i = 0; i < m; i++){
        int idx = N;
        for (int j = 0; j < N; j++)
            if (q[i].Inside(p[faces[j][0]], p[faces[j][1]], p[faces[j][2]]))
                idx = j;
        has[comp[idx]] = 1;
    }
    for (int i = 0; i < e; i++){
        vector<int> v;
        for (int j = 0; j < N; j++){
            int cnt = 0;
            for (int k = 0; k < 3; k++)
                if (faces[j][k] == E[i][0] || faces[j][k] == E[i][1])
                    cnt++;
            if (cnt == 2) v.pb(comp[j]);
        }
        if (v.size() == 1) v.pb(comp[N]);
        cout << (has[v[0]] || has[v[1]]);
    }
    cout << en;
}

int main(){

    ios::sync_with_stdio(false);
    cin.tie(0); cout.tie(0); cerr.tie(0);
    cout << setprecision(12) << fixed;
    cerr << setprecision(12) << fixed;
    cerr << "Started!" << endl;

    int t = 1;
    //cin >> t;
    while (t--)
        Solve();

    return 0;
}