#include "bits/stdc++.h"
using namespace std;
typedef long long LL;
const int maxn = 100000 + 10;
int ch[32*maxn][2];LL val[32*maxn];
int sz;
void init(){memset(ch[0], 0 ,sizeof(ch[0]));sz = 1;}
void insert_01tree(LL a){int u = 0;for(int i = 31; i >= 0; i--) {int c = ((a>>i)&1);if(!ch[u][c]){//新开节点，使得上一级的节点指向新开的节点memset(ch[sz], 0, sizeof(ch[sz])); val[sz]=0;ch[u][c] = sz++;}u = ch[u][c];}val[u] = a; //储存当前的值
}
LL query(LL a){int u = 0;for(int i = 31; i >= 0; i--){int c = ((a>>i)&1);if(ch[u][c^1]) u = ch[u][c^1];else u = ch[u][c];}return val[u];}
int main(int argc, char const *argv[]){int T;int Kcase = 0;scanf("%d", &T);while (T--) {LL a; init();int N, M;scanf("%d%d", &N, &M);for (int i = 0; i < N; i++) {scanf("%lld", &a);insert_01tree(a);}printf("Case #%d:\n", ++Kcase);while (M--) {scanf("%lld", &a);printf("%lld\n", query(a));}}return 0;
}

#include "bits/stdc++.h"
using namespace std;
typedef long long LL;
const int maxn = 1e5;
LL a[maxn], val[maxn];
int ch[maxn][2], num[maxn];
int sz = 1;
void insert_01tree(LL x) {int u = 0;for (int i = 32; i >= 0; i--) {int c = ((x>>i)&1);if (!ch[u][c]) {memset(ch[sz], 0, sizeof(ch[sz]));num[sz] = 0; val[sz] = 0;ch[u][c] = sz++;}u = ch[u][c]; num[u]++; }val[u] = x;
}
void updata(LL x, int d) {int u = 0;for (int i = 32; i >= 0; i--) {int c = ((x>>i)&1);u = ch[u][c];num[u] += d;}
}
LL query(LL x) {int u = 0; for (int i = 32; i >= 0; i--) {int c = ((x>>i)&1);if(num[ch[u][c^1]] and ch[u][c^1]) u = ch[u][c^1];else u = ch[u][c];}return val[u];
}
void init() {memset(ch[0], 0, sizeof(ch[0]));memset(val, 0, sizeof(val));memset(num, 0, sizeof(num));sz = 1;
}
int main(int argc, char const *argv[])
{int T;scanf("%d", &T);while (T--) {init();int N;LL maxx = 0;scanf("%d", &N);for (int i = 0; i < N; i++) scanf("%lld", a+i), insert_01tree(a[i]);for (int i = 0; i < N; i++) {for (int j = i + 1; j < N; j++) {updata(a[i], -1); updata(a[j], -1);maxx = max(maxx ,(a[i]+a[j]) xor query(a[i]+a[j]));updata(a[i], 1); updata(a[j], 1);}}printf("%lld\n", maxx);}return 0;
}