#include<bits/stdc++.h>
using std::cin, std::cout;
using u64 = unsigned long long;
const int mod = 1e9 + 7;
using ll = long long;
struct vec2 {
	int x, y;
};
vec2 operator - (const vec2 & x, const vec2 & y) {
	return {x.x - y.x, x.y - y.y};
}
vec2 operator + (const vec2 & x, const vec2 & y) {
	return {x.x + y.x, x.y + y.y};
}
ll operator * (vec2 x, vec2 y) {
	return (ll) x.x * y.y - (ll) x.y * y.x;
}
int T;
int n, m;

struct pr { int l, r, id; };
int main() {
	std::ios::sync_with_stdio(false), cin.tie(0);
	int T; cin >> T;
	for(int i = 0;i < T;++i) {
		cin >> n >> m;
		std::vector<vec2> a(n);
		std::vector<vec2> b(m);
		for(auto & [x, y] : a) cin >> x >> y;
		for(auto & [x, y] : b) cin >> x >> y;
		std::vector<pr> ranges;
		int id = 0;
		for(vec2 x : b) {
			++ id;
			int l = 0, r = 0;
			for(int j = 1;j < n;++j) {
				if((a[j] - x) * (a[l] - x) < 0) l = j;
				if((a[j] - x) * (a[r] - x) > 0) r = j;
			}
			if(l < r) {
				ranges.push_back({l, r, id});
				ranges.push_back({l + n, r + n, id});
			} else {
				ranges.push_back({l, r + n, id});
			}
		}
		sort(ranges.begin(), ranges.end(), [](auto l, auto r) { return l.l < r.l; });
		int ans = n + 1;
		std::vector<int> ids;
		for(int i = 0;i < (int) ranges.size();++i) {
			static std::vector<int> tmp;
			int goal = ranges[i].l + n;
			int x = i, j = i + 1;
			tmp = {ranges[i].id};
			for(;ranges[x].r < goal;) {
				int max = x;
				for(;j < (int) ranges.size() && ranges[j].l <= ranges[x].r;++j) {
					if(ranges[j].r > ranges[max].r) {
						max = j;
					}
				}
				if(max == x) {
					break;
				}
				x = max;
				tmp.push_back(ranges[x].id);
			}
			if(ranges[x].r >= goal) {
				if(tmp.size() < ans) {
					ans = tmp.size();
					ids = tmp;
				}
			}
		}
		if(ans <= n) {
			cout << ans << '\n';
			for(int x : ids) {
				cout << x << ' ';
			}
			cout << '\n';
		} else {
			cout << -1 << '\n';
		}
	}
}