#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cstdlib>
#include <cmath>
#define LL unsigned long long
using namespace std;
const int MAXN=3200000+5;
LL init(){
    LL rv=0,fh=1;
    char c=getchar();
    while(c<'0'||c>'9'){
        if(c=='-') fh=-1;
        c=getchar();
    }
    while(c>='0'&&c<='9'){
        rv=(rv<<1)+(rv<<3)+c-'0';
        c=getchar();
    }
    return fh*rv;
}
struct node{
    int nxt[2];
}trie[MAXN];
LL T,n,num,nume,m;
void ins(const LL id){
    LL u=0;
    for(int i=31;i>=0;i--){
        bool v=(id>>i)&(LL)1;
        if(!trie[u].nxt[v]) trie[u].nxt[v]=++nume;
        u=trie[u].nxt[v];
    }
}
LL query(const LL id){
    LL u=0,ans=0;
    for(int i=31;i>=0;i--){
        bool v=(id>>i)&(LL)1;
        if(trie[u].nxt[!v]){
            ans=(ans<<1)+!v;
            u=trie[u].nxt[!v];
        }else{
            ans=(ans<<1)+v;
            u=trie[u].nxt[v];
        }
    }
    return ans;
}
int main(){
    freopen("in.txt","r",stdin);
    T=init();
    while(T--){
        printf("Case #%d:\n",++num);
        n=init();m=init();
        for(int i=1;i<=n;i++){
            int t=init();
            ins(t);
        }
        for(int i=1;i<=m;i++){
            int t=init();
            printf("%d\n",query(t));
        }
        memset(trie,0,sizeof(trie));
        nume=0;
    }
    fclose(stdin);
    return 0;
}