#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N=2e5+299;

int T,n,cc,q;

void clear()
{
    cc=0;
}

struct node
{
    int x,y,id,t;
    
    friend bool operator<(node a,node b)
    {
        return a.x==b.x?a.y<b.y:a.x<b.x;
    }

    friend node operator-(node a,node b)
    {
        return (node){a.x-b.x,a.y-b.y,a.id,a.t};
    }

    friend node operator+(node a,node b)
    {
        return (node){a.x+b.x,a.y+b.y,a.id,a.t};
    }

    int find(int a,int b)
    {
        return (x+a)*(y+b);
    }
}a[N],p[90];

int cross(node a,node b)
{
    return a.x*b.y-a.y*b.x;
}

void add(int pos)
{
    int m;cin>>m;
    for(int i=1;i<=m;i++)
    {
        double xx,yy,eps=1e-4;
        cin>>xx>>yy;
        int x,y,res=0,id=0;
        xx*=100;yy*=100;x=xx;y=yy;
        while(x-xx>eps)x--;
        while(xx-x>eps)x++;
        while(y-yy>eps)y--;
        while(yy-y>eps)y++;
        p[i]=node{x,y,i,pos};
    }
    p[++m]=(node){0,0,-1,-1};
    sort(p+1,p+1+m);
    int top=0;
    for(int i=1;i<=m;i++)
    {
        if(i+1<=m&&p[i].x==p[i+1].x)continue;
        while(top>1&&cross(p[top]-p[top-1],p[i]-p[top-1])>=0)top--;
        p[++top]=p[i];
    }
    for(int i=2;i<=top;i++)a[++cc]=p[i]-p[i-1];
}

int f[N];

void sol()
{
    cin>>n;
    for(int i=1;i<=n;i++)add(i);
    sort(a+1,a+1+cc,[&](node a,node b){return cross(a,b)<0;});
    cin>>q;
    while(q--)
    {
        double xx,yy,eps=1e-4;
        cin>>xx>>yy;
        int x,y,res=0,id=0;
        xx*=100;yy*=100;x=xx;y=yy;
        while(x-xx>eps)x--;
        while(xx-x>eps)x++;
        while(y-yy>eps)y--;
        while(yy-y>eps)y++;
        node now=node{0,0};
        for(int i=1;i<=cc;i++)
        {
            now=now+a[i];
            if(now.find(x,y)>res)res=now.find(x,y),id=i;
        }
        for(int i=1;i<=id;i++)f[a[i].t]=a[i].id;
        for(int i=1;i<=n;i++)cout<<f[i]<<' ';
        puts("");
    }
}

signed main()
{
    // freopen("in","r",stdin);
    // freopen("out","w",stdout);
    cin>>T>>T;
    while(T--)sol(),clear();
}