#include <bits/stdc++.h>
using namespace std;

const int N = 2e5 + 5;
const int M = 6e5 + 5;

int T, n, m, k, s, t, tot, idn, idm, toth, totx, toty, h[N], cur[N], lv[N], xv[N], yv[N], ur[N], uc[N];
bool ans[N], vis[N];
queue<int> q;

struct P {
	int x, y;

	P (int x = 0, int y = 0):
		x(x),  y(y) {}
} a[N], b[N];

struct E {
	int v, w, id, nxt;
} e[M];

vector<int> ar[N], ac[N], br[N], bc[N], idr[N], idc[N];

void add(int u, int v, int id, int w) {
	e[++tot].v = v;
	e[tot].w = w;
	e[tot].id = id;
	e[tot].nxt = h[u];
	h[u] = tot;
}

bool cmpr(int i, int j) {
	return b[i].y < b[j].y;
}

bool cmpc(int i, int j) {
	return b[i].x < b[j].x;
}

bool bfs() {
	for (int i = 1; i <= t; i++) {
		lv[i] = -1;
	}
	lv[s] = 0;
	q.push(s);
	while (!q.empty()) {
		int u = q.front();
		q.pop();
		for (int i = h[u]; i; i = e[i].nxt) {
			int v = e[i].v, w = e[i].w;
			if (lv[v] == -1 && w > 0) {
				lv[v] = lv[u] + 1;
				q.push(v);
			}
		}
	}
	return lv[t] != -1;
}

int dfs(int u, int mn) {
	if (u == t) {
		return mn;
	}
	int sum = 0;
	for (int &i = cur[u]; i; i = e[i].nxt) {
		int v = e[i].v, w = e[i].w;
		if (lv[v] == lv[u] + 1 && w > 0) {
			int f = dfs(v, min(mn, w));
			sum += f;
			mn -= f;
			e[i].w -= f;
			e[i ^ 1].w += f;
			if (mn == 0) {
				break;
			}
		}
	}
	return sum;
}

int dinic() {
	int res = 0;
	while (bfs()) {
		for (int i = 1; i <= t; i++) {
			cur[i] = h[i];
		}
		res += dfs(s, 1e9);
	}
	return res;
}

void work() {	
	cin >> n >> m >> k;
	totx = 0;
	toty = 0;
	for (int i = 1; i <= n; i++) {
		cin >> a[i].x >> a[i].y;
		xv[++totx] = a[i].x;
		yv[++toty] = a[i].y;
	}
	for (int i = 1; i <= m; i++) {
		cin >> b[i].x >> b[i].y;
		xv[++totx] = b[i].x;
		yv[++toty] = b[i].y;
	}
	sort(xv + 1, xv + totx + 1);
	totx = unique(xv + 1, xv + totx + 1) - xv - 1;
	sort(yv + 1, yv + toty + 1);
	toty = unique(yv + 1, yv + toty + 1) - yv - 1;
	for (int i = 1; i <= totx; i++) {
		ar[i].clear();
		br[i].clear();
	}
	for (int i = 1; i <= toty; i++) {
		ac[i].clear();
		bc[i].clear();
	}
	for (int i = 1; i <= n; i++) {
		a[i].x = lower_bound(xv + 1, xv + totx + 1, a[i].x) - xv;
		a[i].y = lower_bound(yv + 1, yv + toty + 1, a[i].y) - yv;
		ar[a[i].x].emplace_back(a[i].y);
		ac[a[i].y].emplace_back(a[i].x);
	}
	for (int i = 1; i <= m; i++) {
		b[i].x = lower_bound(xv + 1, xv + totx + 1, b[i].x) - xv;
		b[i].y = lower_bound(yv + 1, yv + toty + 1, b[i].y) - yv;
		br[b[i].x].emplace_back(i);
		bc[b[i].y].emplace_back(i);
	}
	idn = 0;
	for (int i = 1; i <= m; i++) {
		ur[i] = 0;
		uc[i] = 0;
	}
	toth = 0;
	for (int i = 1; i <= totx; i++) {
		if (ar[i].size() <= 1) {
			continue;
		}
		idr[i].resize(ar[i].size() - 1);
		sort(ar[i].begin(), ar[i].end());
		sort(br[i].begin(), br[i].end(), cmpr);
		for (int j = 0, k = 0; j + 1 < ar[i].size(); j++) {
			idr[i][j] = ++idn;
			while (k < br[i].size() && b[br[i][k]].y < ar[i][j]) {
				k++;
			}
			if (k < br[i].size() && b[br[i][k]].y < ar[i][j + 1]) {
				toth++;
			}
			while (k < br[i].size() && b[br[i][k]].y < ar[i][j + 1]) {
				ur[br[i][k]] = idn;
				k++;
			}
		}
	}
	idm = idn;
	for (int i = 1; i <= toty; i++) {
		if (ac[i].size() <= 1) {
			continue;
		}
		idc[i].resize(ac[i].size() - 1);
		sort(ac[i].begin(), ac[i].end());
		sort(bc[i].begin(), bc[i].end(), cmpc);
		for (int j = 0, k = 0; j + 1 < ac[i].size(); j++) {
			idc[i][j] = ++idn;
			while (k < bc[i].size() && b[bc[i][k]].x < ac[i][j]) {
				k++;
			}
			if (k < bc[i].size() && b[bc[i][k]].x < ac[i][j + 1]) {
				toth++;
			}
			while (k < bc[i].size() && b[bc[i][k]].x < ac[i][j + 1]) {
				uc[bc[i][k]] = idn;
				k++;
			}
		}
	}
	s = idn + 1;
	t = idn + 2;
	tot = 1;
	for (int i = 1; i <= t; i++) {
		h[i] = 0;
	}
	for (int i = 1; i <= idm; i++) {
		add(s, i, -1, 1);
		add(i, s, -1, 0);
	}
	for (int i = idm + 1; i <= idn; i++) {
		add(i, t, -1, 1);
		add(t, i, -1, 0);
	}
	for (int i = 1; i <= m; i++) {
		if (ur[i] && uc[i]) {
			add(ur[i], uc[i], i, 1);
			add(uc[i], ur[i], -1, 0);
		}
	}
	int mx = dinic();
	for (int i = 1; i <= m; i++) {
		ans[i] = 0;
	}
	vis[0] = 1;
	for (int i = 1; i <= t; i++) {
		vis[i] = 0;
	}
	for (int u = 1; u <= t; u++) {
		for (int i = h[u]; i; i = e[i].nxt) {
			int w = e[i].w, id = e[i].id;
			if (id != -1 && w == 0) {
				ans[id] = 1;
				vis[ur[id]] = 1;
				vis[uc[id]] = 1;
			}
		}
	}
	if (m - k < mx) {
		cout << idn - 2 * (m - k) << '\n';
		for (int i = 1, cnt = m - k; i <= m; i++) {
			if (ans[i] == 1) {
				if (cnt > 0) {
					cnt--;
				} else {
					ans[i] = 0;
				}
			}
		}
		for (int i = 1; i <= m; i++) {
			if (ans[i] == 0) {
				cout << i << ' ';
			}
		}
		cout << '\n';
	} else {
		cout << idn - min(m - k + mx, toth) << '\n';
		for (int i = 1, cnt = m - k - mx; i <= m; i++) {
			if (ans[i] == 0 && cnt > 0 && (!vis[ur[i]] || !vis[uc[i]])) {
				vis[ur[i]] = 1;
				vis[uc[i]] = 1;
				ans[i] = 1;
				cnt--;
			}
		}
		for (int i = 1, cnt = k; i <= m; i++) {
			if (ans[i] == 0) {
				if (cnt > 0) {
					cnt--;
				} else {
					ans[i] = 1;
				}
			}
		}
		for (int i = 1; i <= m; i++) {
			if (ans[i] == 0) {
				cout << i << ' ';
			}
		}
		cout << '\n';
	}
}

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> T;
	while (T--) {
		work();
	}

	return 0;
}