#include <bits/stdc++.h>
#include <immintrin.h>

using namespace std;

using ll = long long;
using ld = long double;
# define x first
# define y second
# define all(x) x.begin(), x.end()
# define rall(x) x.rbegin(), x.rend()

mt19937 mt(123);

void solve();
void init();

int32_t main() {
#ifndef LOCAL
    cin.tie(nullptr)->sync_with_stdio(false);
#endif
    init();
    cout << fixed << setprecision(10);
    int t = 1;
    cin >> t;
    while (t--) {
        solve();
    }
}

void init() {}

int get(int x, vector<int>& dsu) {
    return dsu[x] == x ? x : dsu[x] = get(dsu[x], dsu);
}

void merge(int x, int y, vector<int>& dsu) {
    dsu[get(y, dsu)] = get(x, dsu);
}

int tim;

bool try_kun(int s, vector<int>& used, vector<vector<int>>& g, vector<int>& pr) {
    used[s] = tim;
    for (int i : g[s]) {
        if (used[i] < tim) {
            if (pr[i] == -1) {
                pr[s] = i;
                pr[i] = s;
                return true;
            }
        }
    }
    for (int i : g[s]) {
        if (used[i] < tim && used[pr[i]] < tim) {
            used[i] = tim;
            if (try_kun(pr[i], used, g, pr)) {
                pr[s] = i;
                pr[i] = s;
                return true;
            }
        }
    }
    return false;
}

void solve() {
    int n, m, k;
    cin >> n >> m >> k;
    vector<int> uv(m, 0), uh(m, 0);
    vector<pair<int, int>> a(n), b(m);
    unordered_map<int, vector<pair<int, int>>> v, h;
    for (int i = 0; i < n; i++) {
        cin >> a[i].x >> a[i].y;
        v[a[i].x].emplace_back(a[i].y, -1);
        h[a[i].y].emplace_back(a[i].x, -1);
    }
    vector<int> dsuv(m), dsuh(m);
    for (int i = 0; i < m; i++) {
        cin >> b[i].x >> b[i].y;
        v[b[i].x].emplace_back(b[i].y, i);
        h[b[i].y].emplace_back(b[i].x, i);
        dsuv[i] = i;
        dsuh[i] = i;
    }
    int ans = 0;
    for (auto [tr, vc] : v) {
        sort(all(vc));
        while (!vc.empty() && vc.back().y != -1) {
            vc.pop_back();
        }
        reverse(all(vc));
        while (!vc.empty() && vc.back().y != -1) {
            vc.pop_back();
        }
        reverse(all(vc));
        for (int i = 0; i + 1 < vc.size(); i++) {
            if (vc[i].y != -1 && vc[i + 1].y != -1) {
                merge(vc[i].y, vc[i + 1].y, dsuv);
            }
            if (vc[i].y == -1 && vc[i + 1].y == -1) {
                ans++;
            }
            if (vc[i].y != -1) {
                uv[vc[i].y] = 1;
            }
        }
    }
    for (auto [tr, vc] : h) {
        sort(all(vc));
        while (!vc.empty() && vc.back().y != -1) {
            vc.pop_back();
        }
        reverse(all(vc));
        while (!vc.empty() && vc.back().y != -1) {
            vc.pop_back();
        }
        reverse(all(vc));
        for (int i = 0; i + 1 < vc.size(); i++) {
            if (vc[i].y != -1 && vc[i + 1].y != -1) {
                merge(vc[i].y, vc[i + 1].y, dsuh);
            }
            if (vc[i].y == -1 && vc[i + 1].y == -1) {
                ans++;
            }
            if (vc[i].y != -1) {
                uh[vc[i].y] = 1;
            }
        }
    }
    vector<vector<int>> g(m);
    vector<int> pr(2 * m, -1), cost(m, 0), usedv(m, 0), usedh(m, 0), used(2 * m, 0);
    for (int i = 0; i < m; i++) {
        if (uv[i] && uh[i]) {
            g[get(i, dsuv)].push_back(get(i, dsuh) + m);
        }
    }
    vector<pair<int, int>> ord(m);
    for (int i = 0; i < m; i++) {
        ord[i] = {g[i].size(), i};
    }
    sort(all(ord));
    for (int tr = 0; tr < m; tr++) {
        int i = ord[tr].y;
        for (int j : g[i]) {
            if (!used[j - m]) {
                pr[i] = j;
                pr[j] = i;
                used[j - m] = 1;
                break;
            }
        }
    }
    tim = 2;
    for (int i = 0; i < m; i++) {
        if (pr[i] == -1) {
            try_kun(i, used, g, pr);
            tim++;
        }
    }

    for (int i = 0; i < m; i++) {
        if (uv[i] && uh[i] && pr[get(i, dsuv)] == get(i, dsuh) + m) {
            cost[i] = 2;
            usedv[get(i, dsuv)] = 1;
            usedh[get(i, dsuh)] = 1;
        }
    }
    for (int i = 0; i < m; i++) {
        if (uv[i] && !usedv[get(i, dsuv)]) {
            cost[i] = 1;
            usedv[get(i, dsuv)] = 1;
        }
        if (uh[i] && !usedh[get(i, dsuh)]) {
            cost[i] = 1;
            usedh[get(i, dsuh)] = 1;
        }
    }
    vector<int> res;
    for (int i = 0; i < m && res.size() < k; i++) {
        if (!cost[i]) {
            res.push_back(i + 1);
        }
    }
    for (int i = 0; i < m && res.size() < k; i++) {
        if (cost[i] == 1) {
            res.push_back(i + 1);
            ans++;
        }
    }
    for (int i = 0; i < m && res.size() < k; i++) {
        if (cost[i] == 2) {
            res.push_back(i + 1);
            ans += 2;
        }
    }
    cout << ans << '\n';
    for (int i : res) {
        cout << i << ' ';
    }
    cout << '\n';
}