#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define db double
#define fi first
#define se second
#define inf 0x3f3f3f3f
#define vi vector<int>
using namespace std;
const int N=5e4+5;
int tid,T,L,Q,pos,p[N],q[N];
ll A,B;
struct node{
    ll x,y;
    int i,j;
    bool operator <(const node &a)const{
        return x<a.x||x==a.x&&y<a.y;
    }
    ll operator *(const node &a)const{
        return x*a.y-y*a.x;
    }
    node operator -(const node &a)const{
        return {x-a.x,y-a.y,i,j};
    }
}a[15];
vector<node>v[N],all;
vector<node>merge(vector<node>a,vector<node>b){
    vector<node>c;
    c.pb({a[0].x+b[0].x,a[0].y+b[0].y});
    int i=1,j=1;
    while(i<a.size()||j<b.size()){
        if(j==b.size()||i!=a.size()&&b[j]*a[i]>=0){
            c.pb(a[i++]);
        }
        else{
            c.pb(b[j++]);
        }
    }
    return c;
}
vector<node>solve(int l,int r){
    if(l==r)return v[l];
    int mid=l+r>>1;
    return merge(solve(l,mid),solve(mid+1,r));
}
signed main(){
    //freopen("data.in","r",stdin);
    //freopen("variance.out","w",stdout);
    ios::sync_with_stdio(false);
    cin.tie(0),cout.tie(0);
    cin>>tid>>T;
    while(T--){
        cin>>L;
        for(int i=1;i<=L;i++){
            int K;cin>>K;
            for(int j=1;j<=K;j++)cin>>a[j].x>>a[j].y,a[j].i=i,a[j].j=j;
            sort(a+1,a+1+K);
            v[i].clear();
            for(int j=1;j<=K;j++){
                while(v[i].size()>=2&&(v[i].back()-v[i][v[i].size()-2])*(a[j]-v[i].back())>=0)v[i].pop_back();
                v[i].pb(a[j]);
            }
            for(int j=v[i].size()-1;j>0;j--){
                v[i][j]=v[i][j]-v[i][j-1];
            }
            q[i]=a[1].j;
        }
        all=solve(1,L);
        // for(int i=0;i<all.size();i++){
        //     cout<<all[i].x<<" "<<all[i].y<<" "<<all[i].i<<" "<<all[i].j<<"\n";
        // }
        //cout<<q[1]<<" "<<q[2]<<"\n";
        cin>>Q;
        while(Q--){
            cin>>A>>B,pos=0;
            ll x=all[0].x,y=all[0].y,res=(A+x)*(B+x);
            for(int i=1;i<all.size();i++){
                x+=all[i].x,y+=all[i].y;
                //cout<<"find:"<<x<<" "<<y<<"\n";
                if((A+x)*(B+y)>res){
                    res=(A+x)*(B+y);
                    pos=i;
                }
            }
            for(int i=1;i<=L;i++)p[i]=q[i];
            for(int i=1;i<=pos;i++){
                p[all[i].i]=all[i].j;
            }
            //cout<<pos<<"\n";
            for(int i=1;i<=L;i++)cout<<p[i]<<" ";
            cout<<"\n";
        }
    }
}