#include<cstdio>

 #include<cstring>

 #include<iostream>

 using namespace std;

 int ch[][];

 int cnt;

 int val[];

 inline void build(long long x){

     int u = ;

     for(int i = ; i >= ; i--){

         int id = (x >> i) & ;

         if(ch[u][id] == ) ch[u][id] = ++cnt;

         u = ch[u][id];

     }

     val[u] = x;

 }

 inline long long query(long long x){

     int u = ;

     for(int i = ; i >= ; i--){

         int id = (x >> i) & ;

         if(ch[u][id^]) u = ch[u][id^];

         else u = ch[u][id];

     }

     return val[u];

 }

 int main(){

     int t;

     scanf("%d", &t);

     for(int i = ; i <= t; i++){

         memset(ch, , sizeof(ch));

         cnt = ;

         memset(val, , sizeof(val));

         int n, m;

         scanf("%d%d", &n, &m);

         for(int j = ; j <= n; j++){

             long long x;

             scanf("%lld", &x);

             build(x);

         }

         printf("Case #%d:\n", i);

         for(int k = ; k <= m; k++){

             long long x;

             scanf("%lld", &x);

             printf("%lld\n", query(x));

         }

     }

     return ;

 }