1 #include <iostream>
 2 #include <cstdio>
 3 #include <cstring>
 4 #include <algorithm>
 5 #include <vector>
 6 #include <cmath>
 7 #include <queue>
 8 #include <stack>
 9 #include <map>
10 #include <string>
11 #include <set>
12 using namespace std;
13 typedef long long LL;
14 const int INF = 2e9;
15 const LL LNF = 9e18;
16 const int MOD = 1e9+7;
17 const int MAXN = 1e5+10;
18
19 struct Trie
20 {
21     int next[33*MAXN][2];
22     int root, L = 0;
23     int newnode()
24     {
25         next[L][0] = next[L][1] = -1;
26         L++;
27         return L-1;
28     }
29     void init()
30     {
31         L = 0;
32         root = newnode();
33     }
34     void insert(LL val)
35     {
36         int tmp = root, way;
37         for(int i = 32; i>=0; i--)
38         {
39             way = (val>>i)&1;
40             if(next[tmp][way]==-1) next[tmp][way] = newnode();
41             tmp = next[tmp][way];
42         }
43     }
44     LL query(LL val)
45     {
46         LL ret = 0;
47         int tmp = root, way;
48         for(int i = 32; i>=0; i--)
49         {
50             ret <<= 1;
51             way = (val>>i)&1;
52             if(next[tmp][!way]!=-1) //如果另一方向存在，则走另一方向
53                 ret ^= !way, tmp = next[tmp][!way];
54             else    //否则，顺着走
55                 ret ^= way, tmp = next[tmp][way];
56         }
57         return ret;
58     }
59 };
60 Trie T;
61
62 int main()
63 {
64     int n, m, TT;
65     scanf("%d",&TT);
66     for(int kase = 1; kase<=TT; kase++)
67     {
68         scanf("%d%d",&n,&m);
69         T.init();
70         for(int i = 1; i<=n; i++)
71         {
72             LL val;
73             scanf("%lld",&val);
74             T.insert(val);
75         }
76
77         printf("Case #%d:\n",kase);
78         while(m--)
79         {
80             LL val;
81             scanf("%lld",&val);
82             printf("%lld\n", T.query(val));
83         }
84     }
85 }