#include <iostream>
#include <algorithm>
using namespace std;
int main() {
int t,m,i,j,n,k,a[1001];
cin>>t;
while(t--) {
cin>>n>>k;
for(i=0;i<n;i++)
cin>>a[i];
sort(a, a + n, std::greater<int>());
m=1;
while(m<=a[0])
m<<=1;
m>>=1;
i=0;
while(m) {
if(a[i] & m) {
for(j=i+1;j<n; j++) {
if((a[j] & m))
a[j]=a[i]^a[j];
}
i++;
m=m>>1;
}
else {
for(j=i+1;j<n; j++) {
if(a[j] & m) {
a[i] ^= a[j] ^= a[i] ^=a[j];
break;
}
}
if(j==n) {
m=m>>1;
}
}
}
for(i=0;i<n;i++) {
if((k^a[i])>k)
k^=a[i];
}
cout<<k<<endl;
}
return 0;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8YWxnb3JpdGhtPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKaW50IG1haW4oKSB7CglpbnQgdCxtLGksaixuLGssYVsxMDAxXTsKCWNpbj4+dDsKCXdoaWxlKHQtLSkgewoJCWNpbj4+bj4+azsKCQlmb3IoaT0wO2k8bjtpKyspCgkJCWNpbj4+YVtpXTsKIAoJCXNvcnQoYSwgYSArIG4sIHN0ZDo6Z3JlYXRlcjxpbnQ+KCkpOwogCgkJbT0xOwoJCXdoaWxlKG08PWFbMF0pCgkJCW08PD0xOwoJCW0+Pj0xOwoKIAoJCWk9MDsKCQl3aGlsZShtKSB7CgkJCWlmKGFbaV0gJiBtKSB7CgkJCQlmb3Ioaj1pKzE7ajxuOyBqKyspIHsKCQkJCQlpZigoYVtqXSAmIG0pKQoJCQkJCQlhW2pdPWFbaV1eYVtqXTsKCQkJCX0gCgkJCQlpKys7CgkJCQltPW0+PjE7CgkJCX0JCQkKCQkJZWxzZSB7CgkJCQlmb3Ioaj1pKzE7ajxuOyBqKyspIHsKCQkJCQlpZihhW2pdICYgbSkgewoJCQkJCQlhW2ldIF49IGFbal0gXj0gYVtpXSBePWFbal07CgkJCQkJCWJyZWFrOwoJCQkJCX0KCQkJCX0KCQkJCWlmKGo9PW4pIHsKCQkJCQltPW0+PjE7CgkJCQl9CgkJCX0KCQl9CgoJCWZvcihpPTA7aTxuO2krKykgewoJCQlpZigoa15hW2ldKT5rKQoJCQkJa149YVtpXTsKCQl9CgkJY291dDw8azw8ZW5kbDsKCX0KcmV0dXJuIDA7Cn0=