using namespace std;

#include <set>
#include <map>
#include <list>
#include <deque>
#include <stack>
#include <queue>
#include <cmath>
#include <cstdio>
#include <vector>
#include <string>
#include <bitset>
#include <utility>
#include <algorithm>

#define pb push_back
#define sz size
#define f first
#define s second
#define II inline
#define ll long long
#define db double
#define FOR(i,a,b) for(int i=a;i<=b;++i)
#define all(v) v.begin() , v.end()
#define CC(v) memset((v),0,sizeof((v)))
#define CP(v,w) memcpy((v),(w),sizeof((w)))
#define mp make_pair

#define IN "xerox.in"
#define OUT "xerox.out"

typedef vector<int> VI;
typedef pair<int,int> pi;
typedef vector<string> VS;

char sir[1<<12];
int T,N;

II void scan()
{
	freopen(IN,"r",stdin);
	freopen(OUT,"w",stdout);
	scanf("%d",&T);
}

II void solve()
{
	int rez,x;
	scanf("%d%d%d",&N,&rez,&rez);
	
	rez = 0;
	FOR(i,1,N)
	{
		scanf("%d",&x);
		rez ^= x;
		fgets(sir,1<<12,stdin);
	}	
	printf("%d\n",(bool)rez);
}	

int main()
{
	scan();
	for(++T;--T;solve());
	return 0;
}