#include<fstream>
#include<iostream>
#include<iomanip>
#include<vector>
#include<set>
#include<algorithm>
#include<utility>
#define endl "\n"
#define point pair<double, double>
#define INF 100000000
using namespace std;

ifstream fin("packing.in");
ofstream fout("packing.out");

int f;
struct fig
{
    int k;
    bool placed;
    vector< point > dots[128];
};

fig figs[512];
vector<int> placed_figs;

bool on_line(point a1, point a2, point p)
{  //check whether p is on the line a or not
   if(p.first <= max(a1.first, a2.first)
      && p.first <= min(a1.first, a2.first) &&
      (p.second <= max(a1.second, a2.second)
       && p.second <= min(a1.second, a2.second)) )
      return true;

   return false;
}

int dir(point a, point b, point c)
{
    int val = (b.second-a.second)*(c.first-b.first)-(b.first-a.first)*(c.second-b.second);
    if (val == 0) return 0; //colinear
    else if(val < 0) return 2; //anti-clockwise direction
    return 1; //clockwise direction
}

bool edges_cross(fig fa, fig fb)
{
    for(int i=0; i<fa.k; ++i)
    {
        for(int j=0; j<fb.k; ++j)
        {
            for(int a=1; a<fa.dots[i].size(); ++a)
            {
                for(int b=1; b<fb.dots[j].size(); ++b)
                {
                    point a1, a2, b1, b2;

                    if(a==0)
                    {
                        a1=fa.dots[i][a];
                        a2=fa.dots[i][fa.dots[i].size()-1];
                    }
                    else
                    {
                        a1=fa.dots[i][a];
                        a2=fa.dots[i][a-1];
                    }

                    if(b==0)
                    {
                        b1=fb.dots[j][b];
                        b2=fb.dots[j][fb.dots[j].size()-1];
                    }
                    else
                    {
                        b1=fb.dots[j][b];
                        b2=fb.dots[j][b-1];
                    }

                    /*cout<<a1.first<<" "<<a1.second<<endl;
                    cout<<a2.first<<" "<<a2.second<<endl;
                    cout<<b1.first<<" "<<b1.second<<endl;
                    cout<<b2.first<<" "<<b2.second<<endl;*/
                    int d1=dir(a1, a2, b1);
                    int d2=dir(a1, a2, b2);
                    int d3=dir(b1, b2, a1);
                    int d4=dir(b1, b2, a2);

                    // general case
                    if(d1!=d2 && d3!=d4) {return true;}

                    // special cases
                    if(d1==0 && on_line(a1, a2, b1)) {return true;}
                    if(d2==0 && on_line(a1, a2, b2)) {return true;}
                    if(d3==0 && on_line(b1, b2, a1)) {return true;}
                    if(d4==0 && on_line(b1, b2, a2)) {return true;}
                }
            }
        }
    }
    return false;
}

bool dot_inside(point p, fig fa)
{
    point extr;
    extr.first=INF;
    extr.second=p.second;
    int cntr=0;
    for(int i=0; i<fa.k; ++i)
    {
        for(int a=1; a<fa.dots[i].size(); ++a)
        {
            point a1, a2, b1, b2;
            b1=p;
            b2=extr;
            if(a==0)
            {
                a1=fa.dots[i][a];
                a2=fa.dots[i][fa.dots[i].size()-1];
            }
            else
            {
                a1=fa.dots[i][a];
                a2=fa.dots[i][a-1];
            }
            int d1=dir(a1, a2, b1);
            int d2=dir(a1, a2, b2);
            int d3=dir(b1, b2, a1);
            int d4=dir(b1, b2, a2);

            // general case
            if(d1!=d2 && d3!=d4) {cntr++;}

            // special cases
            if(d1==0 && on_line(a1, a2, b1)) {cntr++;}
            if(d2==0 && on_line(a1, a2, b2)) {cntr++;}
            if(d3==0 && on_line(b1, b2, a1)) {cntr++;}
            if(d4==0 && on_line(b1, b2, a2)) {cntr++;}
        }
    }
    if(cntr%2!=0)
        return true;

    return false;
}

bool dots_inside(fig fa, fig fb)
{
    for(int i=0; i<fa.k; ++i)
    {
        for(int j=0; j<fa.dots[i].size(); ++j)
        {
            point a=fa.dots[i][j];
            if(dot_inside(a, fb)) return true;
        }
    }

    for(int i=0; i<fb.k; ++i)
    {
        for(int j=0; j<fb.dots[i].size(); ++j)
        {
            point b=fb.dots[i][j];
            if(dot_inside(b, fa)) return true;
        }
    }

    return false;
}

bool overlaps(fig fa, fig fb)
{
    if(edges_cross(fa, fb)) return true;
    if(dots_inside(fa, fb)) return true;
    return false;
}

int main()
{
    fout<<setprecision(6);
    fin>>f;

    for(int i=0; i<f; ++i)
    {
        int p, m;

        fin>>p;
        vector< point > dots;
        double x, y;
        for(int j=0; j<p; ++j)
        {
            fin>>x>>y;
            point dot;
            dot.first=x;
            dot.second=y;
            dots.push_back(dot);
        }

        fin>>m;
        figs[i].k=m;
        for(int j=0; j<m; ++j)
        {
            int k;
            fin>>k;
            k--;
            int dot_idx;
            for(int u=0; u<=k; ++u)
            {
                fin>>dot_idx;
                point dot=dots[dot_idx];
                figs[i].dots[j].push_back(dot);
            }
        }
    }

    for(int i=0; i<f; ++i)
    {
        fout<<0<<endl;
    }

    fin.close();
    fout.close();
    return 0;
}