#include <cstdio>
#include <string>
int a[256];
int g[256];
int n, m;
void solve()
{

  int i, j, k;

  g[0]=0;
  bool use[10001];



  for(i=1;i<=200;++i)
    {
      memset(use, 0, sizeof(use));

      for(j=1;j<=i;++j)
	for(k=1;k<=i-j;++k)
	  use[g[i-j-k]^g[k]]=1;

      for(j=0;j<=10000;++j)
	if(!use[j]) { g[i]=j; break;}
    }
	



}



int main()
{
  int T, p, q,A, B;
  solve();
  int i, j;
  freopen("xerox.in","r",stdin);
  freopen("xerox.out","w",stdout);
  scanf("%d", &T);
  while(T--)
    {
      scanf("%d %d %d",&n, &A, &B);
      int sol=0;
      for(i=1;i<=n;++i)
	{
	  scanf("%d", &m);
	  for(j=1;j<=m;++j) scanf("%d %d", &p, &q);
	  sol^=m;
	}
      if(sol) printf("1\n");
      else printf("0\n");
    }

  
  //int i;

  /*
  for(i=0;i<=20;++i)printf("%d ", g[i]);  
  printf("(%d)\n", g[200]);
  for(i=1;i<=200;++i)printf("%d ", g[i]);
   
  int j, k;
  i=9;
  j=3;
  k=2;
  printf("%d %d\n", i-j-k, k);
  
  */
return 0;
}