#include <bits/stdc++.h>

using namespace std;

#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (a) - 1; i >= (b); i--)
#define FILL(a, b) memset(a, b, sizeof(a))
#define SZ(a) int(a.size())
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first
#define S second

typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef double db;

struct Point
{
	int x, y;
	Point() {}
	Point(int _x, int _y): x(_x), y(_y) {}
	Point operator-(const Point& p) const
	{
		return {x - p.x, y - p.y};
	}
	LL operator*(const Point& p) const
	{
		return (LL)x * p.y - (LL)p.x * y;
	}
};

int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	int t;
	cin >> t;
	while (t--)
	{
		int n, m;
		cin >> n >> m;
		vector<Point> p(n);
		for (Point& pi : p)
			cin >> pi.x >> pi.y;
		p.push_back(p[0]);
		p.push_back(p[1]);
		vector<pair<pair<int, int>, int>> seg(m, MP(MP(-1, -1), -1));
		FOR(i, 0, m)
		{
			Point q;
			cin >> q.x >> q.y;
			FOR(j, 0, n)
			{
				LL prod1 = (p[j + 1] - p[j]) * (q - p[j]);
				LL prod2 = (p[j + 2] - p[j + 1]) * (q - p[j + 1]);
				if (prod1 > 0 && prod2 < 0)
				{
					assert(seg[i].F.F == -1);
					seg[i].F.F = (j + 1) % n;
				}
				if (prod1 < 0 && prod2 > 0)
				{
					assert(seg[i].S == -1);
					seg[i].F.S = j + 1;
				}
			}
			seg[i].S = i;
			assert(seg[i].F.F != -1 && seg[i].F.S != -1 && seg[i].F.F != seg[i].F.S);
		}
		sort(ALL(seg));
		vector<int> best;
		FOR(i, 0, m)
		{
			if (seg[i].F.F < seg[i].F.S && seg[i].F.F != 0)
				continue;
			int end = seg[i].F.F > seg[i].F.S ? seg[i].F.F : n;
			vector<int> idxes = {seg[i].S};
			int cur = seg[i].F.S;
			int mx = -1, mxIndex;
			bool ok = false;
			FOR(j, 0, m)
			{
				if (j == i || seg[j].F.F > seg[j].F.S)
					continue;
				if (seg[j].F.F <= cur)
				{
					if (seg[j].F.S > mx)
					{
						mx = seg[j].F.S;
						mxIndex = seg[j].S;
					}
					if (mx >= end)
					{
						idxes.push_back(mxIndex);
						ok = true;
						break;
					}
				}
				else if (seg[j].F.F > mx)
				{
					break;
				}
				else
				{
					idxes.push_back(mxIndex);
					cur = mx;
					mx = -1;
					j--;
				}
			}
			if (ok && (best.empty() || SZ(idxes) < SZ(best)))
				best = idxes;
		}
		if (best.empty())
		{
			cout << "-1\n";
		}
		else
		{
			cout << SZ(best) << "\n";
			for (int i : best)
			{
				cout << i + 1 << " ";
			}
			cout << "\n";
		}
	}
}