#include <bits/stdc++.h>

using namespace std;
typedef long long LL;
const int maxn = 45;
const int maxm = (1<<20);
int a[maxn];
LL dp[2][maxm];

int main()
{
    int t;
    scanf("%d", &t);
    for(int k = 1; k <= t; k++)
    {
        int n, m;
        scanf("%d%d", &n, &m);
        for(int i = 1; i <= n; i++)
        {
            scanf("%d", &a[i]);
        }
        memset(dp, 0, sizeof(dp));
        dp[0][0] = 1;
        int pre = 0, now = 1;
        for(int i = 1; i <= n; i++)
        {
            for(int j = 0; j < maxm; j++)
            {
                int x = a[i] ^ j;
                dp[now][x] = dp[pre][x] + dp[pre][j];
            }
            swap(now, pre);
        }
        LL ans = 0;
        for(int i = m; i < maxm; i++)
        {
            ans += dp[pre][i];
        }
        printf("Case #%d: %lld\n", k, ans);
    }
    return 0;
}