#include <bits/stdc++.h>

using namespace std;

typedef pair <int, int> pii;

const int MAX_N = 200000 + 5;
const int MAX_M = 500000 + 5;

int N, M, K, tot, n;
struct Node{
    int x, y, id;
}node[MAX_N];
struct Edge{
	int y, prev, idx;
}e[MAX_M];
int elast[MAX_N], ecnt;
int dx[MAX_N], dy[MAX_N], lin[MAX_N];
char chosen[MAX_N], mark[MAX_N];
vector <int> edge[MAX_N];

void Build(int x, int y, int z) {
	ecnt ++;
	e[ecnt].y = y;
    e[ecnt].idx = z;
	e[ecnt].prev = elast[x];
	elast[x] = ecnt;
}

bool bfs() {
    bool flag = false;
    static int q[MAX_N];
    int hd = 0, tl = -1;
    memset(dy, 0, sizeof(int) * (tot + 1));
    for (int i = 1; i <= n; i ++) {
        dx[i] = 0;
        if (!chosen[i]) q[++ tl] = i;
    }
    while (hd <= tl) {
        int u = q[hd ++];
        for (int i = elast[u]; i; i = e[i].prev) {
            int v = e[i].y;
            if (!dy[v]) {
                dy[v] = dx[u] + 1;
                if (!lin[v]) flag = true;
                else {
                    q[++ tl] = lin[v];
                    dx[lin[v]] = dy[v] + 1;
                }
            }
        }
    }
    return flag;
}

bool Find_aug(int u) {
    for (int i = elast[u]; i; i = e[i].prev) {
        int v = e[i].y;
        if (dy[v] == dx[u] + 1) {
            dy[v] = 0;
            if (!lin[v] || Find_aug(lin[v])) {
                lin[v] = u;
                return chosen[u] = 1;
            }
        }
    }
    return false;
}

void solve() {
    ecnt = 0;
    memset(elast, 0, sizeof(int) * n + 1);
    memset(lin, 0, sizeof(int) * (tot + 1));
    memset(chosen, 0, n + 1); memset(mark, 0, M + 1);
    for (int i = 1; i <= M; i ++) edge[i].clear();
    tot = 0;
    
    cin >> N >> M >> K;
    for (int i = 1; i <= N; i ++) {
        cin >> node[i].x >> node[i].y;
        node[i].id = -i;
    }
    for (int i = 1; i <= M; i ++) {
        cin >> node[i + N].x >> node[i + N].y;
        node[i + N].id = i;
    }
    auto cmp_by_x = [&](const Node &i, const Node &j) -> bool {
        return i.x < j.x || (i.x == j.x && i.y < j.y);
    };
    auto cmp_by_y = [&](const Node &i, const Node &j) -> bool {
        return i.y < j.y || (i.y == j.y && i.x < j.x);
    };
    sort(node + 1, node + N + M + 1, cmp_by_x);
    for (int l = 1, r; l <= N + M; l = r) {
        for (r = l; r <= N + M && node[l].x == node[r].x; r ++);
        for (int i = l, j; i < r; i = j) {
            for ( ; i < r && node[i].id > 0; i ++);
            for (j = i + 1; j < r && node[j].id > 0; j ++);
            if (i < r && j < r) {
                tot ++;
                for (int k = i + 1; k < j; k ++) {
                    edge[node[k].id].push_back(tot);
                }
            }
        }
    }
    n = tot;
    sort(node + 1, node + N + M + 1, cmp_by_y);
    for (int l = 1, r; l <= N + M; l = r) {
        for (r = l; r <= N + M && node[l].y == node[r].y; r ++);
        for (int i = l, j; i < r; i = j) {
            for ( ; i < r && node[i].id > 0; i ++);
            for (j = i + 1; j < r && node[j].id > 0; j ++);
            if (i < r && j < r) {
                tot ++;
                for (int k = i + 1; k < j; k ++) {
                    edge[node[k].id].push_back(tot);
                }
            }
        }
    }
    
    for (int i = 1; i <= M; i ++) {
        if ((int)edge[i].size() == 2) {
            Build(edge[i][0], edge[i][1], i);
        }
    }
    
    while (bfs()) {
        for (int i = 1; i <= n; i ++)
            if (!chosen[i]) Find_aug(i);
    }
    
    int ans = tot, rem = M - K;
    if (rem) {
        for (int i = 1; i <= n; i ++) {
            if (chosen[i]) {
                for (int j = elast[i]; j; j = e[j].prev) {
                    int v = e[j].y;
                    if (lin[v] == i) {
                        ans -= 2;
                        mark[e[j].idx] = 1;
                        break;
                    }
                }
                if (!-- rem) break;
            }
        }
    }
    if (rem) {
        for (int i = 1; i <= M; i ++) {
            if (!mark[i]) {
                char flag = 0;
                for (auto x : edge[i]) {
                    if (!lin[x]) {
                        lin[x] = 1;
                        ans --;
                        flag = 1;
                        mark[i] = 1;
                        break;
                    }
                }
                if (flag && !(-- rem)) break;
            }
        }
    }
    if (rem) {
        for (int i = 1; i <= M; i ++) {
            if (!mark[i]) {
                mark[i] = 1;
                if (!-- rem) break;
            }
        }
    }
    cout << ans << '\n';
    for (int i = 1; i <= M; i ++) {
        if (!mark[i]) cout << i << ' ';
    }
    cout << '\n';
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
    
	int T; cin >> T;
	while (T --) solve();
    
	return 0;
}