#include <bits/stdc++.h>

using namespace std;

signed main() {
    int T; scanf("%*d%d", &T);
    while (T--) {
        int n; scanf("%d", &n);
        int sa = 0, sb = 0;
        vector<int> base(n);
        vector< pair< pair<int, int>, pair<int, int> > > dlt;
        auto tr = [&](double x) {
            return (int)((x + 0.00001) * 100);
        };
        for (int i = 0; i < n; ++i) {
            int m; scanf("%d", &m);
            vector< pair< pair<int, int>, int> > p1, p2;
            for (int j = 0; j < m; ++j) {
                double a, b; scanf("%lf%lf", &a, &b);
                p1.push_back({{tr(a), tr(b)}, j + 1});
            }
            sort(p1.begin(), p1.end());
            for (auto [tmp, i] : p1) {
                auto [a, b] = tmp;
                while (!p2.empty() && b >= p2.back().first.second) p2.pop_back();
                while (p2.size() >= 2 && 1ll * (a - p2.end()[-2].first.first) * (b - p2.back().first.second) - 1ll * (b - p2.end()[-2].first.second) * (a - p2.back().first.first) >= 0) p2.pop_back();
                p2.push_back({{a, b}, i});
            }
            sa += p2[0].first.first, sb += p2[0].first.second;
            base[i] = p2[0].second;
            for (int j = 1; j < (int)p2.size(); ++j) {
                dlt.push_back({{p2[j].first.first - p2[j - 1].first.first, p2[j].first.second - p2[j - 1].first.second}, {i, p2[j].second}});
            }
        }
        sort(dlt.begin(), dlt.end(), [&](auto x, auto y) {
            return 1ll * x.first.first * y.first.second - x.first.second * y.first.first < 0;
        });
        int q; scanf("%d", &q);
        while (q--) {
            double tox, toy; scanf("%lf%lf", &tox, &toy);
            int ox = tr(tox), oy = tr(toy);
            long long res = 1ll * (ox + sa) * (oy + sb);
            long long tx = ox + sa, ty = oy + sb;
            for (auto [a, b] : dlt) tx += a.first, ty += a.second, res = max(res, 1ll * tx * ty);
            vector<int> ans = base;
            tx = ox + sa, ty = oy + sb;
            for (auto [a, b] : dlt) {
                if (1ll * tx * ty == res) break;
                tx += a.first, ty += a.second;
                ans[b.first] = b.second;
            }
            for (int i = 0; i < n; ++i) printf("%d%c", ans[i], " \n"[i + 1 == n]);
        }
    }
    return 0;
}