#include<bits/stdc++.h>
using namespace std;
int n;
#define ll long long
struct no{ll x,y;int id;};
#define pb push_back
no sta[100100];
ll cro(no a,no b){return a.x*b.y-a.y*b.x;}
no operator - (const no &a,const no &b){return (no){a.x-b.x,a.y-b.y,a.id};}
int a1[101000],qz[100100],an[101000],id[100100];
const double eps=1e-4;
void sol(){
    scanf("%d",&n);
    vector<no>A;
    ll tx=0,ty=0;
    for(int i=1,e;i<=n;i++){
        scanf("%d",&e);qz[i]=qz[i-1]+e;
        vector<no>z;double x,y;
        for(int j=1;j<=e;j++){
            scanf("%lf%lf",&x,&y),x*=100,y*=100;
            ll x_=(ll)x,y_=(ll)y;
            while(x_-x>eps)x_--;
            while(x-x_>eps)x_++;
            while(y_-y>eps)y_--;
            while(y-y_>eps)y_++;
            z.pb((no){x_,y_,qz[i-1]+j}),id[qz[i-1]+j]=i;
        }
        sort(z.begin(),z.end(),[&](no a,no b){if(a.x==b.x)return a.y<b.y;return a.x<b.x;});
        int sz=z.size(),top=0;
        for(int j=0;j<sz;j++){
            if(j+1<sz&&z[j].x==z[j+1].x)continue;
            while(top>1&&cro(sta[top]-sta[top-1],z[j]-sta[top-1])>=0)top--;
            sta[++top]=z[j];
        }
        a1[i]=sta[1].id-qz[i-1],tx+=sta[1].x,ty+=sta[1].y;
        for(int j=2;j<=top;j++)A.pb(sta[j]-sta[j-1]);
    }
    sort(A.begin(),A.end(),[&](no a,no b){return cro(a,b)<0;});int as=A.size();
    int q;scanf("%d",&q);
    for(int i=1;i<=q;i++){
        double X_,Y_;scanf("%lf%lf",&X_,&Y_);
        ll X=(ll)(X_*100),Y=(ll)(Y_*100);
        X+=tx,Y+=ty;
        ll mx=-1;int jj=-1;
        for(int j=0;j<=as;j++){
            if(mx<X*Y)mx=X*Y,jj=j;
            if(j<as)X+=A[j].x,Y+=A[j].y;
        }
        assert(jj!=-1);
        for(int j=1;j<=n;j++)an[j]=a1[j];
        for(int j=0;j<jj;j++){
            int X=A[j].id,w=id[X];
            an[w]=X-qz[w-1];
        }
        for(int j=1;j<=n;j++)printf("%d ",an[j]);puts("");
    }
}
int main(){
    int tid,T;scanf("%d%d",&tid,&T);while(T--)sol();
    return 0;
}