#include <bits/stdc++.h>
#define F first
#define S second
#define pb push_back
#define pob pop_back
#define SZ(x) (int)(x.size())
#define all(x) begin(x), end(x)
#ifdef LOCAL
#define HEHE freopen("in.txt", "r", stdin);
#define debug(...) {cout << #__VA_ARGS__ << " = "; dbg(__VA_ARGS__);}
#else
#define HEHE ios_base::sync_with_stdio(0), cin.tie(0);
#define debug(...) 7122;
#endif
using namespace std;

#define chmax(a, b) (a) = (a) > (b) ? (a) : (b)
#define chmin(a, b) (a) = (a) < (b) ? (a) : (b)

#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
void dbg() { cerr << '\n'; }
template<typename T, typename ...U>
void dbg(T t, U ...u) { cerr << t << ' '; dbg(u...); }

#define int long long

struct Dinic {
    #define SZ(x) (int)(x.size())
    struct Edge {
        int to, w, rid;
    };
    vector<vector<Edge>> adj;
    void add_edge(int u, int v, int w) {
        adj[u].pb({v, w, SZ(adj[v])});
        adj[v].pb({u, 0, SZ(adj[u]) - 1});
    }
    int n;
    void init(int _n) {
        n = _n;
        adj.clear();
        adj.resize(n + 1);
    }
    vector<int> d;
    bool bfs(int s, int t) {
        queue<int> q; q.push(s);
        d.assign(n + 1, -1);
        d[s] = 1;
        while (q.size()) {
            int x = q.front(); q.pop();
            for (auto [y, w, rid] : adj[x]) {
                if (d[y] == -1 and w) {
                    d[y] = d[x] + 1;
                    q.push(y);
                }
            }
        }
        return d[t] != -1;
    }
    vector<int> it;
    int dfs(int x, int t, int limit) {
        if (x == t) return limit;
        for (int &i = it[x]; i < SZ(adj[x]); i++) {
            auto &[y, w, rid] = adj[x][i];
            if (!w or d[y] != d[x] + 1) continue;
            if (int r = dfs(y, t, min(limit, w))) {
                w -= r;
                adj[y][rid].w += r;
                return r;
            }
        }
        return 0;
    }
    int max_flow(int s, int t) {
        int flow = 0;
        while (bfs(s, t)) {
            it.assign(n + 1, 0);
            while (int v = dfs(s, t, 2e9)) {
                flow += v;
            }
        }
        return flow;
    }
} dinic;

void solve() {
    int n, m, k;
    cin >> n >> m >> k;
    map<int, vector<int>> r, c;
    FOR (i, 1, n) {
        int x, y; cin >> x >> y;
        r[x].pb(y); c[y].pb(x);
    }
    int atk = 0;
    for (auto &[x, y] : r) {
        sort(all(y));
        atk += y.size() - 1;
    }
    for (auto &[x, y] : c) {
        sort(all(y));
        atk += y.size() - 1;
    }
    vector<int> x(m + 1), y(m + 1);
    vector<int> ocp(m + 1, 0);
    FOR (i, 1, m) {
        cin >> x[i] >> y[i];
        int j = lower_bound(all(r[x[i]]), y[i]) - r[x[i]].begin();
        if (j != r[x[i]].size() and j - 1 >= 0) {
            ocp[i]++;
        }
        j = lower_bound(all(c[y[i]]), x[i]) - c[y[i]].begin();
        if (j != c[y[i]].size() and j - 1 >= 0) {
            ocp[i]++;
        }
    }
    map<tuple<int, int, int, int>, int> mp;
    vector<int> ls, rs; // left side, right side
    vector<pair<int, int>> e;
    map<pair<int, int>, int> eid;
    int cnt = 0;
    FOR (i, 1, m) {
        if (ocp[i] < 2) continue;
        int j1 = lower_bound(all(r[x[i]]), y[i]) - r[x[i]].begin();
        int j2 = lower_bound(all(c[y[i]]), x[i]) - c[y[i]].begin();
        tuple<int, int, int, int> p1 = {x[i], r[x[i]][j1 - 1], x[i], r[x[i]][j1]};
        tuple<int, int, int, int> p2 = {c[y[i]][j2 - 1], y[i], c[y[i]][j2], y[i]};
        if (!mp[p1]) {
            mp[p1] = ++cnt; ls.pb(cnt);
        }
        if (!mp[p2]) {
            mp[p2] = ++cnt; rs.pb(cnt);
        }
        e.pb({mp[p1], mp[p2]});
        eid[{mp[p1], mp[p2]}] = i;
    }
    dinic.init(cnt + 1);
    for (int i : ls) dinic.add_edge(0, i, 1);
    for (int i : rs) dinic.add_edge(i, cnt + 1, 1);
    for (auto [i, j] : e) dinic.add_edge(i, j, 1);
    int flow = dinic.max_flow(0, cnt + 1);
    vector<int> f(m + 1, 0);
    int re = m - k;
    debug(flow, atk, re);
    set<tuple<int, int, int, int>> s;
    for (int u : ls) {
        for (auto [v, w, rid] : dinic.adj[u]) {
            if (re > 0 and v != 0 and w == 0) {
                int i = eid[{u, v}];
                int j1 = lower_bound(all(r[x[i]]), y[i]) - r[x[i]].begin();
                int j2 = lower_bound(all(c[y[i]]), x[i]) - c[y[i]].begin();
                tuple<int, int, int, int> p1 = {x[i], r[x[i]][j1 - 1], x[i], r[x[i]][j1]};
                tuple<int, int, int, int> p2 = {c[y[i]][j2 - 1], y[i], c[y[i]][j2], y[i]};
                s.insert(p1); s.insert(p2);
                f[i] = 1;
                re--;
                atk -= 2;
            }
        }
    }
    // recalculate ocp
    ocp.assign(m + 1, 0);
    FOR (i, 1, m) {
        if (!re) break;
        {
            int j1 = lower_bound(all(r[x[i]]), y[i]) - r[x[i]].begin();
            int j2 = lower_bound(all(c[y[i]]), x[i]) - c[y[i]].begin();
            if (j1 >= 1 and j1 != r[x[i]].size()) {
                tuple<int, int, int, int> p1 = {x[i], r[x[i]][j1 - 1], x[i], r[x[i]][j1]};
                if (s.find(p1) == s.end()) ocp[i]++;
            }
            if (j2 >= 1 and j2 != c[y[i]].size()) {
                tuple<int, int, int, int> p2 = {c[y[i]][j2 - 1], y[i], c[y[i]][j2], y[i]};
                if (s.find(p2) == s.end()) ocp[i]++;
            }
        }
        if (ocp[i] == 0 or f[i]) continue;
        f[i] = 1;
        re--; atk--;
        {
            int j1 = lower_bound(all(r[x[i]]), y[i]) - r[x[i]].begin();
            int j2 = lower_bound(all(c[y[i]]), x[i]) - c[y[i]].begin();
            if (j1 >= 1 and j1 != r[x[i]].size()) {
                tuple<int, int, int, int> p1 = {x[i], r[x[i]][j1 - 1], x[i], r[x[i]][j1]};
                s.insert(p1);
            }
            if (j2 >= 1 and j2 != c[y[i]].size()) {
                tuple<int, int, int, int> p2 = {c[y[i]][j2 - 1], y[i], c[y[i]][j2], y[i]};
                s.insert(p2);
            }
        }
    }

    FOR (i, 1, m) {
        if (!re) break;
        if (f[i]) continue;
        f[i] = 1; re--;
    }
    vector<int> an;
    FOR (i, 1, m) if (!f[i]) an.pb(i);
    assert(k == an.size());
    cout << atk << '\n';
    for (int i : an) cout << i << ' ';
    cout << '\n';
}
signed main() {
    HEHE
    int t; cin >> t;
    while (t--) solve();
}