#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll eps =0;
using pt=ll;
template<typename T> struct point
{
    T x,y;
    bool operator==(const point &a) const {return (abs(x-a.x)<=eps && abs(y-a.y)<=eps);}
    bool operator<(const point &a) const {if(abs(x-a.x)<=eps)return y<a.y-eps;return x<a.x-eps;}
    bool operator>(const point &a) const {return !(*this<a||*this==a);}
    point operator+(const point &a)const {return {x+a.x,y+a.y};}
    point operator-(const point &a)const {return {x-a.x,y-a.y};}
    point operator-()const {return {-x,-y};}
    T operator*(const point &a)const{return x*a.x+y*a.y;}
    T operator^(const point &a)const{return x*a.y-y*a.x;}
    int toleft(const point &a)const{const auto t=(*this)^a;return (t>eps)-(t<-eps);}
};
using Point = point<pt>;
void solve()
{
    int n,m;cin>>n>>m;
    vector<Point> a(n*2);
    for(int i=0;i<n;i++){
        cin>>a[i].x>>a[i].y;
        a[i+n]=a[i];
    }
    vector<Point> b(m);
    for(int i=0;i<m;i++)cin>>b[i].x>>b[i].y;
    vector<pair<int,int>> jump(n*2,make_pair(-1,-1));
    for(int i=0;i<m;i++){
        int pr=-1;
        for(int j=2*n-2;j>=0;j--){
            if((a[j+1]-b[i]).toleft(a[j]-b[i])>0){
                if(pr==-1)pr=j+1;
                // if(j<n)cout<<"edge = "<<j<<" p="<<i<<endl;
            }
            else pr=-1;
            if(pr>jump[j].first){
                jump[j].first=pr;
                jump[j].second=i;
            }
        }
    }
    for(int i=0;i<n;i++)if(jump[i].first==-1){
        cout<<-1<<"\n";return;
    }
    vector<int>ans(m+2);
    for(int i=0;i<n;i++){
        int x=i;
        vector<int>now;
        while(x<i+n){
            now.push_back(jump[x].second);
            x=jump[x].first;
        }
        if(now.size()<ans.size())ans=now;
    }
    cout<<ans.size()<<"\n";
    for(int i=0;i<ans.size();i++)cout<<ans[i]+1<<" \n"[i==ans.size()-1];
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    int T;cin>>T;
    while(T--)solve();
}
/*

1
3 3
0 0
1 0
0 1
-1 -1
3 -1
-1 3

1 
3 2
-1 0
1 0
0 1
1 1 
0 -1
*/