#include<bits/stdc++.h>
const int P = 998244353;
typedef long long ll;
using namespace std;
typedef pair<int, int> pii;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
void solve() {
	int cnt_castle;
	cin >> cnt_castle;
	vector<pair<int, int>> castle(cnt_castle + 1);
	map<int, vector<int>> col;
	map<int, vector<int>> row;
	map<pair<int, int>, bool> exist;
	bool ok = true;
	for (int i = 1; i <= cnt_castle; ++i) {
		cin >> castle[i].first >> castle[i].second;
		col[castle[i].second].push_back(castle[i].first);
		row[castle[i].first].push_back(castle[i].second);
		exist[castle[i]] = true;
		for (int k = 0; k < 4; k++) {
			int x = castle[i].first + dx[k];
			int y = castle[i].second + dy[k];
			if (exist[ {x, y}]) ok = false;
		}
	}
	int cnt_wall;
	cin >> cnt_wall;
	vector<pair<int, int>> wall(cnt_wall + 1);
	for (int i = 1; i <= cnt_wall; ++i) {
		cin >> wall[i].first >> wall[i].second;
	}
	if (!ok) {
		cout << -1 << '\n';
		return;
	}
	vector<pair<pii, pii>> shu(1);
	vector<pair<pii, pii>> heng(1);
	for (auto &[x, y] : col) {
		sort(y.begin(), y.end());
		int len = y.size();
		for (int i = 0; i < len - 1; ++i) {
			bool ok = true;
			for (auto [a, b] : wall) {
				if (b == x && a > y[i] && a < y[i + 1]) ok = false;
			}
			if (!ok) continue;
			else {
				shu.push_back({{y[i] + 1, x}, {y[i + 1] - 1, x}});
			}
		}
	}
	for (auto &[x, y] : row) {
		sort(y.begin(), y.end());
		int len = y.size();
		for (int i = 0; i < len - 1; ++i) {
			bool ok = true;
			for (auto [a, b] : wall) {
				if (a == x && b > y[i] && b < y[i + 1]) ok = false;
			}
			if (!ok) continue;
			else {
				heng.push_back({{x, y[i] + 1}, {x, y[i + 1] - 1}});
			}
		}
	}
	/*	for (auto [x, y] : shu) {
			cout << x.first << ' ' << x.second << ' ' << y.first << ' ' << y.second << '\n';
		}

		for (auto [x, y] : heng) {
			cout << x.first << ' ' << x.second << ' ' << y.first << ' ' << y.second << '\n';
		}*/
	int n = shu.size() - 1 ;
	int m = heng.size() - 1;
	vector<vector<int>> e(n + 1);
	for (int i = 1; i <= n; ++i) {
		int x1 = shu[i].first.first;
		int y1 = shu[i].first.second;
		int x2 = shu[i].second.first;
		int y2 = shu[i].second.second;
		for (int j = 1; j <= m; ++j) {
			int x3 = heng[j].first.first;
			int y3 = heng[j].first.second;
			int x4 = heng[j].second.first;
			int y4 = heng[j].second.second;
			if (x3 >= x1 && x3 <= x2 && y1 >= y3 && y1 <= y4) e[i].push_back(j);
		}
	}
	/*	for (int i = 1; i <= n; ++i) {
			for (auto v : e[i]) {
				cout << v << ' ';
			}
			cout << '\n';
		}*/
	vector<int> match(m + 1);
	vector<bool> vis(m + 1);
	int cnt = 0;
	for (int i = 1; i <= n; ++i) {
		for (int j = 1; j <= m; ++j) vis[j] = 0;
		function<bool(int)> dfs = [&](int u) {
			for (auto v : e[u]) {
				if (vis[v]) continue;
				vis[v] = 1;
				if (!match[v] || dfs(match[v])) {
					match[v] = u;
					return true;
				}
			}
			return false;
		};
		if (dfs(i)) cnt++;
	}
	/*for (int v = 1; v <= m; ++v) {
		cout << v << ' ' << match[v] << '\n';
	}*/
	int ans = n + m - cnt;
	cout << ans << '\n';
	vector<bool> vis1(n + 1);
	vector<bool> vis2(m + 1);
	if (cnt) {
		for (int v = 1; v <= m; ++v) {
			if (match[v]) {
				int u = match[v];
				vis2[v] = true;
				vis1[u] = true;
				cout << heng[v].first.first << ' ' << shu[u].first.second << '\n';
			}
		}
	}
	for (int i = 1; i <= n; ++i) {
		if (vis1[i]) continue;
		cout << shu[i].first.first << ' ' << shu[i].first.second << '\n';
	}
	for (int i = 1; i <= m; ++i) {
		if (vis2[i]) continue;
		cout << heng[i].first.first << ' ' << heng[i].first.second  << '\n';
	}
	return;
}
int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	int t = 1;
	cin >> t;
	while (t--) solve();
	return 0;
}
/*
4
7
1 3
6 6
4 7
2 1
6 3
4 1
2 6
3
3 4
6 4
3 1
2
1 1
2 2
0
3
1 1
1 3
3 3
1
1 2
3
1 1
1 3
2 3
0
*/