#include <bits/stdc++.h>

using namespace std;

#define For(i, a, n) for(int i =a;i<n;i++)
#define endl '\n'
#define vec vector

typedef long long ll;
typedef pair<ll, ll> pii;
template<typename... Args>
void dbg(Args&&... args){
    ((cerr<<args<<" |"),...);
    cerr<<endl;
}
template<class A, class B>
pair<A, B> operator+(const pair<A, B>&a, const pair<A, B>& b){
    return {a.first +b.first, a.second + b.second};
}
template<class A, class B>
ostream& operator<< (ostream& os, const pair<A, B>& a){
    return os<<"("<<a.first<<", "<<a.second<<")";
}
template<class A, class B, class C>
basic_ostream<A, B>& operator<<(basic_ostream<A, B>& os, const C&c){
    for(auto it=begin(c); it!=end(c);++it){
        os<<(it==begin(c)?"":" ")<<*it;
    }
    return os;
}
#define inf 1e18
void solve(){
    ll n, k;
    cin >> n >> k;

    vec<vec<ll>> pb(30);
    For(ind, 0, n){
        ll a;
        cin >> a;
        For(i, 0, 30) if(a & (1 << i)) pb[i].push_back(ind);
    }

    For(i, 0, 30) {
        if(k & (1 << i)) pb[i].push_back(n);
        else pb[i].push_back(n);
    dbg(pb[i]);
    }
    vec<ll> vi(30, 0);
    ll res = 0;
    For(z, 0, n)
    {
        ll mi = 0, ma = n;
        For(i, 0, n)
        {
            if(1 <<i & k)mi = max(mi, pb[i][vi[i]]);
            else ma = min(ma, pb[i][vi[i]]);

            if(pb[i][vi[i]] == z) vi[i]++;
        }

        res += max((ll)0, ma - mi);
    }
    cout<< res<<endl;
}

main(){
    cin.tie(0)->sync_with_stdio(0);
    cin.exceptions(cin.failbit);
    int t=1;//cin>>t;
    while(t--){
        solve();
    }
}