void solve() {
    int n, k;
    cin >> n >> k;
    vector<int> a(n + 1), sum(n + 1);
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
        sum[i] = sum[i - 1] ^ a[i];
    }

    map<int, int> mp; // sum->cnt
    mp[0] = 1;
    long long res = 0;
    for (int i = 1; i <= n; i++) {
        res += mp[sum[i] ^ k];
        mp[sum[i]]++;
    }
    cout << res << '\n';
}