#include <set>

 #include <map>

 #include <deque>

 #include <ctime>

 #include <stack>

 #include <cmath>

 #include <queue>

 #include <string>

 #include <cstdio>

 #include <vector>

 #include <iomanip>

 #include <cstring>

 #include <iostream>

 #include <algorithm>

 using namespace std;

 typedef long long LL;

 typedef pair<LL, LL> pll;

 typedef pair<LL, int> pli;

 typedef pair<int, int> pii;

 typedef unsigned long long uLL;

 #define lson rt<<1

 #define rson rt<<1|1

 #define name2str(name)(#name)

 #define bug printf("**********\n");

 #define IO ios::sync_with_stdio(false);

 #define debug(x) cout<<#x<<"=["<<x<<"]"<<endl;

 #define FIN freopen("/home/dillonh/CLionProjects/in.txt","r",stdin);

 const double eps = 1e-;

 const int maxn = (<<) + ;

 const int inf = 0x3f3f3f3f;

 const double pi = acos(-1.0);

 const LL INF = 0x3f3f3f3f3f3f3f3fLL;

 int t, n, m;

 int a[], dp[][maxn];

 int main() {

 #ifndef ONLINE_JUDGE

     FIN;

 #endif

     int icase = ;

     scanf("%d", &t);

     while(t--) {

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

         int mx = , cnt = ;

         for(int i = ; i <= n; i++) scanf("%d", &a[i]), mx = max(mx, a[i]);

         memset(dp, , sizeof(dp));

         dp[][] = ;

         while(mx) cnt++,mx >>= ;

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

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

                 dp[i&][j] = dp[(i-)&][j] + dp[(i-)&][j^a[i]];

             }

         }

         LL ans = ;

         for(int i = m; i < maxn; i++) ans += dp[n&][i];

         printf("Case #%d: %lld\n", ++icase, ans);

     }

     return ;

 }