#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")

#define fi first
#define se second
#define int long long
#define vec vector


using namespace std;

void solve()
{
    int n, k;
    cin>>n>>k;
    vec<int> a(n);
    for(int i = 0;i<n;i++){
        cin>>a[i];
    }

    vec<vec<int>> pred(n, vec<int>(32, -1));
    vec<int> cur(32, -1);

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

        for(int j = 0;j<32;j++){
            if((a[i] & (1<<j)) > 0 ){
                cur[j] = i;
            }
        }
        pred[i] = cur;
    }


    vec<int> block(n, -1);

    for(int i = 0;i<n;i++){
        int r = a[i] | k;
        if(r != k){
            block[i] = i;
        }
        else{
            if(i == 0){
                block[i] = -1;
            }
            else
                block[i] = block[i-1];
        }
    }

    int ans = 0;


    for(int i = 0;i<n;i++){
        int mn = 1e18;
        for(int j = 0;j<32;j++){
            if(((k & (1 << j)) > 0)){
                mn = min(pred[i][j], mn);
            }
        }
        if(block[i] >= mn){
            continue;
        }
        else{
            ans += (mn - block[i]);
        }
    }


    cout << ans << "\n";

}

signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int tests = 1;
    while(tests--)
    {
        solve();
    }

}