// sis puella oier
#include <bits/stdc++.h>
using namespace std;
// #define int long long
typedef long long ll;
ll read(){
    ll xx = 0, f = 1; char ch = getchar();
    for (;!isdigit(ch); ch = getchar())f = (ch == '-' ? -1 : 1);
    for (; isdigit(ch); ch = getchar())xx = (xx << 3) + (xx << 1) + ch - '0';
    return xx * f;
}
ll rdd(){
    ll xx = 0, f = 1, xx1 = 0; bool fl = false; char ch = getchar();
    for (;!isdigit(ch); ch = getchar())f = (ch == '-' ? -1 : 1);
    for (; isdigit(ch); ch = getchar()){
        if (ch == '.'){fl = true; continue;}
        if (!fl)xx = (xx << 3) + (xx << 1) + ch - '0';
        else xx1 = (xx1 << 3) + (xx1 << 1) + ch - '0';
    }
    return f * (xx * 100 + xx1);
}
const int N = 50010;
struct node{
    ll x, y; int i, j;
}a[15];
bool operator < (node x, node y){
    return x.x == y.x ? x.y < y.y : x.x < y.x;
}
node operator - (node x, node y){
    return node{x.x - y.x, x.y - y.y, x.i, x.j};
}
ll operator * (node x, node y){
    return x.x * y.y - x.y * y.x;
}
int L;
vector <node> ve[N];
vector <node> merge(vector <node> x, vector <node> y){
    vector <node> ret; ret.clear();
    ret.push_back(node{x[0].x + y[0].x, x[0].y + y[0].y, -1, -1});
    int i = 1, j = 1;
    while(i < x.size() || j < y.size()){
        if (j == y.size() || (i < x.size() && x[i] * y[j] < 0))ret.push_back(x[i++]);
        else ret.push_back(y[j++]);
    }
    return ret;
}
vector <node> mg(int l, int r){
    if (l == r)return ve[l];
    int mid = (l + r) >> 1; return merge(mg(l, mid), mg(mid + 1, r));
}
int itans[N], ans[N];
void solve(){
    L = read();
    for (int i = 1, len; i <= L; ++i){
        len = read();
        for (int j = 1; j <= len; ++j)
            a[j].x = rdd(), a[j].y = rdd(), a[j].i = i, a[j].j = j;
        sort(a + 1, a + len + 1);
        ve[i].clear();
        for (int j = 1; j <= len; ++j){
            while(ve[i].size() >= 2){
                int l = ve[i].size(); --l;
                if ((ve[i][l] - ve[i][l - 1]) * (a[j] - ve[i][l]) >= 0)ve[i].pop_back();
                else break;
            }
            ve[i].push_back(a[j]);
        }
        for (int j = (int)ve[i].size() - 1; j > 0; --j)ve[i][j] = ve[i][j] - ve[i][j - 1];
        // for (auto it : ve[i])cout<<it.x<<" "<<it.y<<endl; cout<<endl;
        itans[i] = ve[i][0].j;
    }
    vector <node> tot = mg(1, L);
    // for (auto it : tot)cout<<it.x<<" "<<it.y<<" "<<it.i<<" "<<it.j<<endl;
    int q = read(); ll A, B, x, y, tmp; int id;
    while(q--){
        A = rdd(), B = rdd();
        id = 0, x = tot[0].x, y = tot[0].y, tmp = (A + x) * (B + y), id = 0;
        for (int i = 1; i < tot.size(); ++i){
            x += tot[i].x, y += tot[i].y;
            if ((A + x) * (B + y) > tmp)tmp = (A + x) * (B + y), id = i;
            // cout<<i<<" "<<x<<" "<<y<<" "<<tmp<<endl;
            // cout<<A+x<<" "<<B+y<<endl;
        }
        // cout<<id<<endl;
        for (int i = 1; i <= L; ++i)ans[i] = itans[i];
        for (int i = 1; i <= id; ++i)ans[tot[i].i] = tot[i].j;
        for (int i = 1; i <= L; ++i)printf("%d ", ans[i]); printf("\n");
    }
}
signed main(){
    int tdd = read(), _ = read();
    while(_--)solve();
    return 0;
}