#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int, int> pii;
const int N = 305;
struct P {
    int x, y;
    int Phase() {
        if (y != 0) return y > 0 ? 0 : 1;
        return x > 0 ? 0 : 1;
    }
};
P operator+(P u, P v) { return {u.x + v.x, u.y + v.y}; }
P operator-(P u, P v) { return {u.x - v.x, u.y - v.y}; }
int Det(P u, P v) { return u.x * v.y - u.y * v.x; }
int n, m, e;
P bp[N], sp[N];
P edg_mp[N];
int edg_hs[N][2], sp_hs[N];
vector<pii> g[N];
inline int Intersect(P x, P u, P v) {
    if ((u - x).Phase() == (v - x).Phase()) return 0;
    if ((u - x).Phase() == 0) swap(u, v);
    return Det(v - u, x - u) > 0;
}
inline int Inside(P cur, const vector<P> &pts) {
    int area = 0;
    for (int i = 0; i + 1 < pts.size(); ++i) area += Det(pts[i], pts[i + 1]);
    int cnt = (area <= 0 ? 1 : 0);
    for (int j = 0; j + 1 < pts.size(); ++j) {
        if (Intersect(cur, pts[j], pts[j + 1])) ++cnt;
    }
    return cnt & 1;
}
mt19937 rd(1025);
signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cin >> n >> m >> e;
    for (int i = 1; i <= n; ++i) {
        cin >> bp[i].x >> bp[i].y;
        bp[i].x *= 2; bp[i].y *= 2;
    }
    for (int i = 1; i <= m; ++i) {
        cin >> sp[i].x >> sp[i].y;
        sp[i].x *= 2; sp[i].y *= 2;
    }
    for (int i = 0, x, y; i < e; ++i) {
        cin >> x >> y;
        g[x].push_back({y, i << 1});
        g[y].push_back({x, i << 1 | 1});
        edg_mp[i] = bp[x] + bp[y];
        edg_mp[i].x /= 2; edg_mp[i].y /= 2;
    }
    for (int i = 1; i <= n; ++i) {
        sort(g[i].begin(), g[i].end(), [&](pii u, pii v) {
            P vecu = bp[u.first] - bp[i];
            P vecv = bp[v.first] - bp[i];
            int du = vecu.Phase();
            int dv = vecv.Phase();
            if (du != dv) return du < dv;
            return Det(vecu, vecv) > 0;
        });
    }
    vector<int> vis(e << 1);
    for (int x = 1, ts = 0; x <= n; ++x) {
        for (auto [y, id] : g[x]) if (!vis[id]) {
            ++ts;
            vector<P> pts(2);
            vector<int> eds(1);
            pts[0] = bp[x]; pts[1] = bp[y]; 
            eds[0] = id;
            vis[id] = ts;
            for (int nx = y, la = x, la_id = id; ; ) {
                int k = find(g[nx].begin(), g[nx].end(), pii(la, la_id ^ 1)) - g[nx].begin();
                k = (k + g[nx].size() - 1) % g[nx].size();
                auto [nnx, nid] = g[nx][k];
                vis[nid] = ts;
                eds.push_back(nid);
                pts.push_back(bp[nnx]);
                if (nnx == x) break;
                la = nx; nx = nnx; la_id = nid; 
            }
            // for (auto [x, y] : pts) cerr << "(" << x << ' ' << y << ')';
            // cerr << endl;
            int cur_hash = rd();
            for (int i = 1; i <= m; ++i) if (Inside(sp[i], pts)) sp_hs[i] ^= cur_hash;
            for (int i = 0; i < e; ++i) {
                bool is_on = 0;
                if (vis[i << 1] == ts) {
                    is_on = 1;
                    edg_hs[i][0] ^= cur_hash;
                }
                if (vis[i << 1 | 1] == ts) {
                    is_on = 1;
                    edg_hs[i][1] ^= cur_hash;   
                }
                if (!is_on && Inside(edg_mp[i], pts)) {
                    edg_hs[i][0] ^= cur_hash;
                    edg_hs[i][1] ^= cur_hash;
                }
            }
        }
    }
    set<int> st;
    for (int i = 1; i <= m; ++i) st.insert(sp_hs[i]);
    string ans(e, '0');
    for (int i = 0; i < e; ++i) if (st.count(edg_hs[i][0]) || st.count(edg_hs[i][1])) ans[i] = '1';
    cout << ans << endl;
    return 0;
}