#include<bits/stdc++.h>
#define int long long
#define pii pair<int, int> 
using namespace std;
const int N = 1005; 
int vis[N][2 * N];
int len[N][2 * N];
int n, m;
int add(int x, int k){
	return 1 + (x - 1 + k) % n; 
}
int dis(int x0, int x1, int y0, int y1, int x, int y){
	return (y1 - y0) * (x - x0) - (x1 - x0) * (y - y0);
}
void solve(){
	cin >> n >> m;
	// clear()
	for(int i = 1;i <= m; ++ i)
		for(int j = 1; j <= 2 * n + 1; ++ j) vis[i][j] = len[i][j] = 0;
	//
	vector<pii> a(n + 1);
	for(int i = 1; i <= n; ++ i){
		int x, y; cin >> x >> y;
		a[i] = {x, y};
	}
	for(int i = 1; i <= m; ++ i){
		int x, y; cin >> x >> y;
		for(int j = 1; j <= n; ++ j){
			auto [a1, a2] = a[j];
			auto [b1, b2] = a[add(j, 1)];
			auto [c1, c2] = a[add(j, 2)];
			int d1 = dis(a1, b1, a2, b2, x, y) > 0 ? 1 : -1, d2 = dis(a1, b1, a2, b2, c1, c2) > 0 ? 1 : -1;
			if(d1 * d2 < 0) vis[i][j] = vis[i][j + n] = 1; 
		}
	}
	for(int i = 1; i <= m; ++ i){
		for(int j = 2 * n; j >= 1; -- j){
			if(vis[i][j]) len[i][j] = len[i][j + 1] + 1;
			else len[i][j] = 0;
		}
	}
	vector<int> f(2 * n, 0), ker(2 * n, -1);
	for(int j = 1; j <= 2 * n; ++ j){
		for(int i = 1; i <= m; ++ i){
			if(f[j] < len[i][j]){
				f[j] = len[i][j];
				ker[j] = i;
			}
		}
	}
	int ans = 1e14;
	vector<int> nans;
	for(int i = 1; i <= n; ++ i){
		vector<int>rans;
		int l = i, r = i + f[i], cs = 1;
		rans.push_back(ker[i]);
		while(l < r && r < i + n){
			int nr = r, tt;
			for(int j = l + 1; j <= r; ++ j){
				if(nr < j + f[j]){
					nr = j + f[j];
					tt = ker[j];
					// cout << tt << endl;
				}
			}
			l = r;
			r = nr;
			rans.push_back(tt);
			++cs;
		}
		if(r >= i + n) {
			if(ans > cs){
				ans = cs;
				nans = rans;
			}
		}
	}
	// cout << (ans == 1e14? -1: ans) << endl;
	if(ans == 1e14) cout << -1 << endl;
	else{
		cout << ans << endl;
		for(auto x: nans) cout << x << " ";
		cout << endl;
	}
}
signed main(){
	ios::sync_with_stdio(0);
	int T;
	cin >> T;
	while(T--) solve();
	return 0;
}