20pts

#include<bits/stdc++.h>
using namespace std;
const int N=5e5+10;
int a[N];
int n;
int tree[N<<2];
inline int lowbit(int x){
    return x&-x;
}
inline int query(int x){
    int sum=0;
    while (x){
        sum^=tree[x];
        x-=lowbit(x);
    }
    return sum;
}
void change(int x,int k){
    while (x<=n){
        tree[x]^=k;
        x+=lowbit(x);
    }
}
int main(){
    int k;
    scanf("%d%d",&n,&k);
    for (int i=1;i<=n;++i) scanf("%d",&a[i]);
    for (int i=1;i<=n;++i){
        change(i,a[i]);
    }
    int ans=0,flag=0;
    for (int i=1;i<=n;++i){
        for (int j=i;j<=n;++j){
            if (i<=flag) break;
            int sum=query(j)^query(i-1);
            if (sum==k){
                flag=j;
                ++ans;
            }
        }
    }
    cout<<ans;
    return 0;
}