#include <bits/stdc++.h>
using namespace std;
static const int MAXN = 1000001;
int lule[MAXN+1];
long long sp[MAXN][21];
long long nd(int L, int R){
    int length = R - L + 1;
    int k = lule[length];
    return sp[L][k] & sp[R - (1<<k) + 1][k];
}

long long arr[MAXN];
long long N, M;
int main(){
    freopen("note2.in","r",stdin);
    freopen("note2.out","w",stdout);
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    lule[1] = 0;
    for(int i = 2; i <= MAXN; i++){
        lule[i] = lule[i/2] + 1;
    }
    cin >> N >> M;

    for(int i=0; i<N; i++){
        cin >> arr[i];
    }
    int n;
    n=N;
    int kmax = floor(log2(n));
    for(int i=0;i<n;i++){
        sp[i][0]=arr[i];
    }
    for(int k = 1; (1<<k) <= n; k++){
        int length = (1 << k);
        for(int i = 0; i + length - 1 < n; i++){
            int half = (1 << (k-1));
            sp[i][k] = sp[i][k-1] & sp[i + half][k-1];
        }
    }
    long long ans = 0;

    for(int i=0; i<N; i++){
        int low = i, high = N-1;
        int best = i-1;
        while(low <= high){
            int mid = (low + high)/2;
            long long val = nd(i, mid);
            if(val >= M){
                best = mid;
                low = mid + 1;
            } else {
                high = mid - 1;
            }
        }
        if(best >= i){
            ans += (best - i + 1);
        }
    }

    cout << ans << "\n";
    return 0;
}