#include <bits/stdc++.h>

#define x first
#define y second
#define el '\n'
#define debug(x) cout << #x << ": " << x << el
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int N = 1010, INF = 0x3f3f3f3f, mod = 998244353;

pll operator-(pll a, pll b) {
    return {a.x - b.x, a.y - b.y};
}

ll operator^(pll a, pll b) {
    return a.x * b.y - a.y * b.x;
}

ll area(pll a, pll b, pll c) {
    return b - a ^ c - a;
}

int sign(ll a) {
    if (a > 0) return 1;
    if (a < 0) return -1;
    return 0;
}

pll q[N * 2];
pll lit[N];
vector<pii> rs[N * 2];

void solve() {
    int n, m; cin >> n >> m;
    for (int i = 0; i <= n * 2; ++i) rs[i].clear();
    for (int i = 0; i < n; ++i) {
        cin >> q[i].x >> q[i].y;
        q[i + n] = q[i];
    }
    q[n + n] = q[0], q[n + n + 1] = q[1];
    for (int i = 1; i <= m; ++i) {
        cin >> lit[i].x >> lit[i].y;
        int l = -1, r = -1;
        for (int j = 0, t = 0; j < n * 2; ++j) {
            if (sign(area(q[j], q[j + 1], q[j + 2])) == sign(area(q[j], q[j + 1], lit[i]))) {
                if (t == 2) {
                    r = j - 1;
                    break;
                }
                t = 1;
            } else {
                if (!t) continue;
                t = 2;
                if (l == -1) l = j;
            }
        }
        if (l != -1) rs[l].emplace_back(r, i), rs[l + n].emplace_back(r, i);
        // cout << l << ' ' << r << endl;
    }
    vector<int> way(n + 1);
    for (int i = 1; i <= n; ++i) {
        if (rs[i].empty()) continue;
        vector<int> V;
        int mr = -1;
        V.emplace_back(-1);
        for (auto[r, id]: rs[i]) {
            if (r > mr) {
                mr = r;
                V.back() = id;
            }
        }
        int last = i;
        while (mr < i + n - 1) {
            int nr = mr;
            V.emplace_back(-1);
            for (int j = last + 1; j <= mr + 1; ++j) {
                for (auto[r, id]: rs[j]) {
                    if (r > nr) {
                        nr = r;
                        V.back() = id;
                    }
                }
            }
            if (nr == mr) {
                break;
            }
            last = mr + 1;
            mr = nr;
        }
        if (V.back() != -1 && V.size() < way.size()) way.swap(V);
    }
    if (way.size() == n + 1) cout << -1 << el;
    else {
        cout << way.size() << el;
        for (int i = 0; i < way.size(); ++i) {
            cout << way[i] << " \n"[i + 1 == way.size()];
        }
    }
}

int main() {
    ios::sync_with_stdio(0); cin.tie(0);
    int tcase = 1;
    cin >> tcase;
    while (tcase--) solve();
}