#include<bits/stdc++.h>
#define f first
#define s second
#define ll long long
using namespace std;
const ll maxn=1e6+10;
ll n;
ll m;
ll a[maxn];
ll tree[4*maxn];
void build(int node=1,int l=1,int r=n)
{
    if(l==r)
    {
        tree[node]=a[l];
        return;
    }
    build(node*2,l,(l+r)/2);
    build(node*2+1,(l+r)/2+1,r);
    tree[node]=tree[node*2]&tree[node*2+1];
}
ll query(int ql,int qr,int node=1,int l=1,int r=n)
{
    if(qr<l || r<ql) return (1<<61)-1;
    if(ql<=l && r<=qr) return tree[node];
    return query(ql,qr,node*2,l,(l+r)/2)&query(ql,qr,node*2+1,(l+r)/2+1,r);
}
int main()
{
    freopen("note2.in","r",stdin);
    freopen("note2.out","w",stdout);
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cin>>n>>m;
    for(int i=1;i<=n;i++)
    {
        cin>>a[i];
        //st[0][i]=a[i];
    }
    build();
    ll ans=0;
    ll lastidx=1;
    for(ll i=1;i<=n;i++)
    {
        if(a[i]<m) continue;
        ll curr=query(i,max(lastidx,i)),idx=max(lastidx+1,i+1);
        while(idx<=n)
        {
            curr&=a[idx];
            if(curr<m) break;
            idx++;
        }
        if(curr>=m)
        {
            ll dumb=n-i+1;
            //printf("1 for %d is %d\n",a[i],dumb);
            ans+=dumb;
            lastidx=n;
        }
        else
        {
            ll dumb=idx-i;
            ans+=dumb;
            lastidx=idx-1;
            //printf("for %d is %d\n",a[i],dumb);
        }
        //i=idx-1;
    }
    cout<<ans<<"\n";
}
/*
5 0
3 3 3 3 3

5 4
7 8 4 5 3
*/