#include<algorithm>

 #include<cstdio>

 #include<cmath>

 #include<cstring>

 #include<iostream>

 #define M 100100

 int T,F,n,sg[],v[],ans;

 int read(){

     int t=,f=;

     char ch=getchar();

     while (ch<''||ch>'') {if (ch=='-') ch=-;ch=getchar();}

     while (''<=ch&&ch<=''){t=t*+ch-'';ch=getchar();}

     return t*f;

 }

 void init(){

     for (int i=;i<F;i++) sg[i]=;

     for (int i=F;i<=;i++){

         for (int j=,pos=;j<=i;j=pos+){

             pos=i/(i/j);int k=i/j;

             int nk1=i%j,nk=j-nk1;

             v[sg[(nk&)*(k)]^sg[(nk1&)*(k+)]]=i;

             if (j+<=std::min(pos,i)){

                 nk1=i%(j+),nk=j+-nk1;

                 v[sg[(nk&)*(k)]^sg[(nk1&)*(k+)]]=i;

             }

         }

         for (int j=;;j++)

          if (v[j]!=i){

                 sg[i]=j;

                 break;

          }

     }

 }

 int main(){

     T=read();F=read();

     init();

     while (T--){

         n=read();

         ans=;int x;

         for (int i=;i<=n;i++)

          x=read(),ans^=sg[x];

         if (!T) printf("%d\n",(!ans)?:);

         else printf("%d ",(!ans)?:);

     }

 }