#include <vector>
#include <stdio.h>
#include <algorithm>
using namespace std;
struct point {
    long long x, y; int i, j;
    bool operator < (const point k) { return x == k.x ? x < k.x : y > k.y; }
    int operator ^ (const point k) const { return x * k.y - y * k.x; }
    point operator + (const point k) { return {x + k.x, y + k.y, i, j}; }
    point operator - (const point k) { return {x - k.x, y - k.y, i, j}; }
} p[500001];

int e[50001], f[50001];
int main()
{
    int h; scanf("%*d%d", &h); while (h--) {
        int n; scanf("%d", &n); point c({0, 0, 0, 0});
        vector<point> d;
        for (int i(1), m; i <= n; ++i)
        {
            scanf("%d", &m);
            for (int j(1); j <= m; ++j)
            {
                double a, b; scanf("%lf%lf", &a, &b);
                p[j] = {int(a * 100), int(b * 100), i, j};
            }
            sort(p + 1, p + m + 1); int t(0), s[11] = {};
            for (int j(1); j <= m; ++j)
            {
                while (t && p[s[t]].y <= p[j].y) --t;
                if (!t || p[s[t]].x < p[j].x) s[++t] = j;
            }
            c = c + p[s[1]]; e[i] = p[s[1]].j;
            for (int j(t); j > 1; --j) d.push_back(p[s[j]] - p[s[j - 1]]);
        }
        sort(begin(d), end(d), [](const point a, const point b) { return (a ^ b) < 0; } );
        int q; scanf("%d", &q); while (q--) {
            double a, b; scanf("%lf%lf", &a, &b); const int x(a * 100), y(b * 100);
            point g(c); int t(-1); long long s((long long)(x + g.x) * (y + g.y));
            for (int i(0); i < (int)size(d); ++i)
            {
                g = g + d[i];
                if ((long long)(x + g.x) * (y + g.y) > s)
                    s = (long long)(x + g.x) * (y + g.y), t = i;
            }
            for (int i(1); i <= n; ++i) f[i] = e[i];
            for (int i(0); i <= t; ++i) f[d[i].i] = d[i].j;
            for (int i(1); i <= n; ++i) printf("%d ", f[i]);
            putchar('\n');
    }   } return 0;
}