#include <bits/stdc++.h>
#define il inline
#define pii pair<int,int>
#define fi first
#define se second
#define pdd pair<double,double>
using namespace std;
const double eps=1e-8;
il double ab(double x){return x>0?x:-x;}
il int isint(double x){return ab(x-int(x))<eps;}
il void cmax(int &x,int y){x=(x>y?x:y);}
il void cmin(int &x,int y){x=(x<y?x:y);}
typedef long long ll;
const int N=50005,M=11,inf=1e9;
int tid,T,n,m,ck,l[N],f[N],g[N],ans[N],id[N][M],d[M];double A,B;pii pre[501][50001];pdd a[N][M],c[M];
il void print(int v){
    int x=v;
    for(int i=n;i;--i) ans[i]=pre[i][x].fi,x=pre[i][x].se;
    for(int i=1;i<=n;++i) printf("%d ",ans[i]);puts("");
}
int cur;
il bool cmp(int x,int y){return a[cur][x]<a[cur][y];}
int x,y,z,v,p,q,s,t;double u,w,mx;
int main(){
    scanf("%d%d",&tid,&T);
    while(T--){
        scanf("%d",&n);ck=1;
        for(int i=1;i<=n;++i){
            scanf("%d",&l[i]);
            for(int j=1;j<=l[i];++j) scanf("%lf%lf",&a[i][j].fi,&a[i][j].se),d[j]=j;
            cur=i;sort(d+1,d+1+l[i],cmp);sort(a[i]+1,a[i]+1+l[i]);
            u=0,x=0;
            for(int j=l[i];j;--j){
                if(a[i][j].se>u) c[++x]=a[i][j],id[i][x]=d[j];
                u=max(u,a[i][j].se);
            }
            for(int j=1;j<=l[i];++j) a[i][j]=c[j];
            for(int j=1;j<=l[i];++j) ck&=isint(a[i][j].fi)&isint(a[i][j].se);
        }
        scanf("%d",&m);
        if(ck){
            s=t=0,f[0]=0;
            for(int i=1;i<=n;++i){
                z=v=0;for(int j=1;j<=l[i];++j) cmax(z,int(a[i][j].fi)),cmin(v,int(a[i][j].fi));
                for(int j=t;j<=s;++j) g[j]=f[j],f[j]=-inf;
                for(int j=s+1;j<=s+z;++j) f[j]=-inf;
                for(int j=1;j<=l[i];++j)
                    for(int k=t;k<=s;++k){
                        x=int(a[i][j].fi)+k,y=g[k]+int(a[i][j].se);
                        if(f[x]<y) f[x]=y,pre[i][x]={id[i][j],k};
                    }
                
                s+=z,t+=v;
            }
            while(m--){
                scanf("%lf%lf",&A,&B);mx=0,p=0;
                for(int i=0;i<=s;++i){
                    w=1.00*(A+i)*(B+f[i]);
                    if(w>mx) mx=w,p=i;
                }
                print(p);
            }
        }
    }
    return 0;
}
/*
1 1
5
3
98 71 28 7 62 13
3
29 23 65 70 34 95
3
59 41 64 43 92 59
3
73 75 99 96 43 2
3
14 24 5 7 54 13
10
8.06 47.73
183.28 351.90
83.70 90.40
34.00 127.83
216.88 312.31
182.09 349.61
266.90 320.28
84.18 420.91
33.26 145.00
118.07 354.22
*/