1 #include <iostream>
 2 #include <cstdio>
 3 #include <cstring>
 4 #include <cmath>
 5 #include <algorithm>
 6 #include <climits>
 7 #include <vector>
 8 #include <queue>
 9 #include <cstdlib>
10 #include <string>
11 #include <set>
12 #include <map>
13 #include <stack>
14 #define LL long long
15 #define INF 0x3f3f3f3f
16 #define pii pair<int,int>
17 using namespace std;
18 const int maxn = 1<<21;
19 int dp[2][maxn],d[41],n,m;
20 int main() {
21     int T,cs=1;
22     scanf("%d",&T);
23     while(T--) {
24         scanf("%d %d",&n,&m);
25         memset(dp,0,sizeof(dp));
26         for(int i = 0; i < n; ++i)
27             scanf("%d",d+i);
28         LL ans = 0;
29         dp[0][0] = 1;
30         int cur = 0;
31         for(int i = 0; i < n; ++i) {
32             memset(dp[cur^1],0,sizeof(dp[cur^1]));
33             for(int j = 0; j < maxn; ++j) {
34                 int tmp = j^d[i];
35                 dp[cur^1][tmp] += dp[cur][j];
36                 dp[cur^1][j] += dp[cur][j];
37             }
38             cur ^= 1;
39         }
40         for(int i = m; i < maxn; ++i)
41             if(dp[cur][i]) ans += dp[cur][i];
42         printf("Case #%d: %I64d\n",cs++,ans);
43     }
44     return 0;
45 }