#pragma GCC optimize(3, "unroll-loops", "no-stack-protector")
#define atsum(l, r) accumulate(l, r, 0)
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/hash_policy.hpp>
using namespace std;
using ll = long long;
using ull = unsigned long long;
constexpr int inf = 0x3f3f3f3f;
constexpr ll INF = 0x3f3f3f3f3f3f3f3f;
template <typename T>
inline void chkmin(T &x, T y) { x = min(x, y); }
template <typename T>
inline void chkmax(T &x, T y) { x = max(x, y); }
namespace FastIO
{
// ------------------------------
#define IN_HAS_NEG
#define OUT_HAS_NEG
#define CHK_EOF
#define DISABLE_MMAP
// ------------------------------
#if __cplusplus < 201400
#error Please use C++14 or higher.
#endif
#if __cplusplus > 201700
#define INLINE_V inline
#else
#define INLINE_V
#endif
#if ( defined(LOCAL) || defined (_WIN32) ) && !defined(DISABLE_MMAP)
#define DISABLE_MMAP
#endif
#ifndef DISABLE_MMAP
#include<sys/mman.h>
#endif
#ifdef LOCAL
    inline char gc() { return getchar(); }
    inline void pc(char c) { putchar(c); }
#else
#ifdef DISABLE_MMAP
    INLINE_V constexpr int _READ_SIZE = 1 << 18;
    INLINE_V static char _read_buffer[_READ_SIZE], *_read_ptr = nullptr, *_read_ptr_end = nullptr;
    inline char gc()
    {
        if ( __builtin_expect(_read_ptr == _read_ptr_end, false) )
        {
            _read_ptr = _read_buffer;
            _read_ptr_end = _read_buffer + fread(_read_buffer, 1, _READ_SIZE, stdin);
#ifdef CHK_EOF
            if ( __builtin_expect(_read_ptr == _read_ptr_end, false) ) return EOF;
#endif
        }
        return *_read_ptr++;
    }
#else
    INLINE_V static const char *_read_ptr = (const char *)mmap(nullptr, INT_MAX, 1, 2, 0, 0);
    inline char gc() { return *_read_ptr++; }
#endif
    INLINE_V constexpr int _WRITE_SIZE = 1 << 18;
    INLINE_V static char _write_buffer[_WRITE_SIZE], *_write_ptr = _write_buffer;
    inline void pc(char c)
    {
        *_write_ptr++ = c;
        if ( __builtin_expect(_write_buffer + _WRITE_SIZE == _write_ptr, false) )
        {
            fwrite(_write_buffer, 1, _write_ptr - _write_buffer, stdout);
            _write_ptr = _write_buffer;
        }
    }
    INLINE_V struct _auto_flush
    {
        ~_auto_flush() { fwrite(_write_buffer, 1, _write_ptr - _write_buffer, stdout); }
    }	_auto_flush;
#endif
#ifdef CHK_EOF
    inline bool _isdigit(char c) { return ( c & 16 ) && c != EOF; }
    inline bool _isgraph(char c) { return c > 32 && c != EOF; }
#else
    inline bool _isdigit(char c) { return c & 16; }
    inline bool _isgraph(char c) { return c > 32; }
#endif
    template < class T >
    INLINE_V constexpr bool _is_integer = numeric_limits < T >::is_integer;
    template < class T >
    INLINE_V constexpr bool _is_signed = numeric_limits < T >::is_signed;
    template < class T >
    INLINE_V constexpr bool _is_unsigned = _is_integer < T > && !_is_signed < T >;
    template <> INLINE_V constexpr bool _is_integer < __int128 > = true;
    template <> INLINE_V constexpr bool _is_integer < __uint128_t > = true;
    template <> INLINE_V constexpr bool _is_signed < __int128 > = true;
    template <> INLINE_V constexpr bool _is_unsigned < __uint128_t > = true;
#undef INLINE_V
    inline void read(char &c) { do c = gc(); while ( !_isgraph(c) ); }
    inline void read_cstr(char *s)
    {
        char c = gc(); while ( !_isgraph(c) ) c = gc();
        while ( _isgraph(c) ) *s++ = c, c = gc();
        *s = 0;
    }
    inline void read(string &s)
    {
        char c = gc(); s.clear(); while ( !_isgraph(c) ) c = gc();
        while ( _isgraph(c) ) s.push_back(c), c = gc();
    }
#ifdef IN_HAS_NEG
    template < class T, enable_if_t < _is_signed < T >, int > = 0 >
    inline void read(T &x)
    {
        char c = gc(); bool f = true; x = 0;
        while ( !_isdigit(c) ) { if ( c == 45 ) f = false; c = gc(); }
        if ( f ) while ( _isdigit(c) ) x = x * 10 + ( c & 15 ), c = gc();
        else     while ( _isdigit(c) ) x = x * 10 - ( c & 15 ), c = gc();
    }
    template < class T, enable_if_t < _is_unsigned < T >, int > = 0 >
#else
    template < class T, enable_if_t < _is_integer < T >, int > = 0 >
#endif
    inline void read(T &x)
    {
        char c = gc(); while ( !_isdigit(c) ) c = gc();
        x = 0; while ( _isdigit(c) ) x = x * 10 + ( c & 15 ), c = gc();
    }
    inline void write(char c) { pc(c); }
    inline void write_cstr(const char *s) { while ( *s ) pc(*s++); }
    inline void write(const string &s) { for ( char c : s ) pc(c); }
#ifdef OUT_HAS_NEG
    template < class T, enable_if_t < _is_signed < T >, int > = 0 >
    inline void write(T x)
    {
        char buffer[numeric_limits < T >::digits10 + 1]; int digits = 0;
        if ( x >= 0 )  do buffer[digits++] =  ( x % 10 ) | 48, x /= 10; while ( x );
        else { pc(45); do buffer[digits++] = -( x % 10 ) | 48, x /= 10; while ( x ); }
        while ( digits ) pc(buffer[--digits]);
    }
    template < class T, enable_if_t < _is_unsigned < T >, int > = 0 >
#else
    template < class T, enable_if_t < _is_integer < T >, int > = 0 >
#endif
    inline void write(T x)
    {
        char buffer[numeric_limits < T >::digits10 + 1]; int digits = 0;
        do buffer[digits++] = ( x % 10 ) | 48, x /= 10; while ( x );
        while ( digits ) pc(buffer[--digits]);
    }
    template < int N > struct _tuple_io_helper
    {
        template < class ...T >
        static inline void _read(tuple < T... > &x)
        { _tuple_io_helper < N - 1 >::_read(x), read(get < N - 1 > (x)); }
        template < class ...T >
        static inline void _write(const tuple < T... > &x)
        { _tuple_io_helper < N - 1 >::_write(x), pc(32), write(get < N - 1 > (x)); }
    };
    template <> struct _tuple_io_helper < 1 >
    {
        template < class ...T >
        static inline void _read(tuple < T... > &x) { read(get < 0 > (x)); }
        template < class ...T >
        static inline void _write(const tuple < T... > &x) { write(get < 0 > (x)); }
    };
    template < class ...T >
    inline void read(tuple < T... > &x) { _tuple_io_helper < sizeof...(T) >::_read(x); }
    template < class ...T >
    inline void write(const tuple < T... > &x) { _tuple_io_helper < sizeof...(T) >::_write(x); }
    template < class T1, class T2 >
    inline void read(pair < T1, T2 > &x) { read(x.first), read(x.second); }
    template < class T1, class T2 >
    inline void write(const pair < T1, T2 > &x) { write(x.first), pc(32), write(x.second); }
    template < class T1, class ...T2 >
    inline void read(T1 &x, T2 &...y) { read(x), read(y...); }
    template < class ...T >
    inline void read_cstr(char *x, T *...y) { read_cstr(x), read_cstr(y...); }
    template < class T1, class ...T2 >
    inline void write(const T1 &x, const T2 &...y) { write(x), write(y...); }
    template < class ...T >
    inline void write_cstr(const char *x, const T *...y) { write_cstr(x), write_cstr(y...); }
    template < class T >
    inline void print(const T &x) { write(x); }
    inline void print_cstr(const char *x) { write_cstr(x); }
    template < class T1, class ...T2 >
    inline void print(const T1 &x, const T2 &...y) { print(x), pc(32), print(y...); }
    template < class ...T >
    inline void print_cstr(const char *x, const T *...y) { print_cstr(x), pc(32), print_cstr(y...); }
    inline void println() { pc(10); }
    inline void println_cstr() { pc(10); }
    template < class ...T >
    inline void println(const T &...x) { print(x...), pc(10); }
    template < class ...T >
    inline void println_cstr(const T *...x) { print_cstr(x...), pc(10); }
}
using namespace FastIO;
template <typename T>
inline void clear(T &x) {
    T y;
    swap(x, y);
}
using ld = long double;
const int N = 50005;
struct Node {
    ld x, y;
    int idx, idy, cid;
};
vector<Node> g, f;
int L;
int a[N];
inline ld calc(Node a, Node b, ld c) {
    return (b.y - a.y) / (b.x - a.x) * (c - a.x) + a.y;
}
inline vector<Node> solve(vector<Node> qaq) {
    sort(qaq.begin(), qaq.end(), [&](Node x, Node y) { return x.x != y.x ? x.x < y.x : x.y < y.y; });
    vector<Node> res;
    for (int i = 0; i < qaq.size(); i++) {
        if (i + 1 != qaq.size() && qaq[i].x == qaq[i + 1].x) continue;
        while (res.size() >= 2 && calc(res.end()[-2], qaq[i], res.back().x) >= res.back().y) res.pop_back();
        res.push_back(qaq[i]);
    }
    return res;
}
int ans[N], pans[N], tans[N];
inline void work() {
    clear(f), clear(g);
    // read(L);
    cin >> L;
    ld jia = 0, jib = 0;
    for (int i = 1; i <= L; i++) {
        clear(f);
        vector<Node> qaq;
        int n1;
        cin >> n1;
        for (int p = 1; p <= n1; p++) {
            ld pa, pb;
            cin >> pa >> pb;
            f.push_back({pa, pb, i, p});
        }
        f = solve(f);
        jia += f[0].x, jib += f[0].y;
        pans[i] = f[0].idy;
        int psiz = g.size();
        for (int j = 1; j < f.size(); j++) g.push_back({f[j].x - f[j - 1].x,  f[j].y - f[j - 1].y, f[j].idx, f[j].idy, j}), qaq.push_back({f[j].x - f[j - 1].x,  f[j].y - f[j - 1].y, f[j].idx, f[j].idy, j});
        for (int j = 1; j < qaq.size(); j++) {
            assert(qaq[j].y / qaq[j].x <= qaq[j - 1].y / qaq[j - 1].x + 1e-15);
        }
        // assert(is_sorted(g.begin() + psiz, g.end(), [&](Node a, Node b) { return a.y / a.x > b.y / b.x; }));
    }
    sort(g.begin(), g.end(), [&](Node a, Node b) { return a.idx == b.idx ? a.cid < b.cid : a.y / a.x > b.y / b.x; });
    int q;
    // cerr << "find pans:" << pans[1] << ' ' << pans[2] << endl;
    // for (auto [px, py, fwa, fwb] : g) cerr << "find youmo:" << px << ' ' << py << ' ' << fwa << ' ' << fwb << endl;
    cin >> q;
    while (q--) {
        ld Xa, Xb;
        cin >> Xa >> Xb;
        ld valans = 0;
        ld pjia = jia, pjib = jib;
        chkmax(valans, (Xa + pjia) * (Xb + pjib));
        for (auto [px, py, fwa, fwb, qid] : g) pjia += px, pjib += py, chkmax(valans, (Xa + pjia) * (Xb + pjib));
        pjia = jia, pjib = jib;
        memcpy(ans, pans, sizeof(ans[0]) * (L + 2));
        memcpy(tans, pans, sizeof(ans[0]) * (L + 2));
        for (auto [px, py, fwa, fwb, qid] : g) {
            // cerr << "find update:" << fwa << ' ' << fwb << endl;
            pjia += px, pjib += py;
            ans[fwa] = fwb;
            if ((Xa + pjia) * (Xb + pjib) == valans) {
                memcpy(tans, ans, sizeof(ans[0]) * (L + 2));
                break;
            }
        }
        // cerr << "find ans:" << valans << endl;
        for (int i =1; i <= L; i++) cout << tans[i] << ' ';
        cout << endl;
    }
}
int main() {
    ios::sync_with_stdio(0), cin.tie(0);
    int T;
    cin >> T >> T;
    while (T--) work();
    return 0;
}