#include <iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<climits>
#include<vector>
#include<queue>
#include<string>
#include <cmath>
#include<set>
#include<map>
#define mod 999997
#define lson l, mid, root << 1
#define rson mid + 1, r, root << 1 | 1
#define father l , r , root
#define lowbit(x) ( x & ( - x ) )
using namespace std;
typedef long long ll;
const int maxn = 1e5+5;
const int inf = 0x3f3f3f3f;
int n;
int k;
int mp[32*maxn][2];
ll vis[32*maxn];
void init(){
memset(mp,0,sizeof(mp));
memset(vis,0,sizeof(vis));
k=1;
}
void Insert(ll x){
int p=0;
for(int i=32;i>=0;i--){
int s=(x>>i)&1;
if(mp[p][s]==0){
mp[p][s]=k++;
}
p=mp[p][s];
}
vis[p]=x;
}
ll findmax(int x){
int p=0;
for(int i=32;i>=0;i--){
int s=(x>>i)&1;
if(mp[p][s^1]){
p=mp[p][s^1];
}else{
p=mp[p][s];
}
}
return vis[p];
}
int main( ){
int t;
scanf("%d",&t);
int cnt=1;
while(t--){
printf("Case #%d:\n",cnt++);
int n,m;
init();
scanf("%d%d",&n,&m);
for(int i=0;i<n;i++){
ll x;
scanf("%lld",&x);
Insert(x);
}
for(int i=1;i<=m;i++){
int val;
scanf("%d",&val);
printf("%lld\n",findmax(val));
}
}
}