#include<bits/stdc++.h>\万能头
using namespace std;
inline long long read() {
long long s = 0, f = 1; char ch;
while(!isdigit(ch = getchar())) (ch == '-') && (f = -f);
for(s = ch ^ 48;isdigit(ch = getchar()); s = (s << 1) + (s << 3) + (ch ^ 48));
return s * f;
}
const int N = 105, M = 1e5 + 5;
int T, F, n;
int a[N], SG[M], vis[N];
int main() {
T = read(); F = read();
for(int i = F;i <= M - 5; i++) {
int r;
for(int j = 2;j <= i; j = r + 1) {
int t = i / j;
r = i / (i / j);
int flag;
if(j == r) flag = 1;
else flag = 2;
int num = 0, res = 0;
while(num < flag) {
num++;
res = 0;
if((i % j) & 1)
res ^= SG[t + 1];
if((j - i % j) & 1)
res ^= SG[t];
j++;
vis[res] = i;
}
}
for(int j = 0; ; j++){
if(vis[j] != i){
SG[i] = j; break;
}
}
}
while(T --> 0) {
n = read();
int res = 0;
for(int i = 1;i <= n; i++) {
a[i] = read();
res ^= SG[a[i]];
}
if(res == 0) printf("0 ");
else printf("1 ");
}
return 0;
}
