#include <fstream>
#include <vector>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <bitset>
#include <string>
#include <queue>
using namespace std;
ifstream cin("note2.in");
ofstream cout("note2.out");
long long a[1000005],aps[70];
int main()
{
    long long n,m,maxx=0;
    cin>>n>>m;
    for(int i=1;i<=n;i++)
    {
        cin>>a[i];
        maxx=max(maxx,a[i]);
    }
    int st=1;
    long long cnt=0;
    for(int dr=1;dr<=n;dr++)
    {
        long long p=0,nr=0;
        while((1LL<<p)<=maxx)
        {
            long long x=(a[dr]&(1LL<<p));
            if(x)
                aps[p]++;
            if(aps[p]==dr-st+1)
                nr+=(1LL<<p);
            p++;
        }
        while(nr<m&&st<=dr)
        {
            p=0, nr=0;
            while((1LL<<p)<=maxx)
            {
                long long x=(a[st]&(1LL<<p));
                if(x)
                    aps[p]--;
                if(aps[p]==dr-st)
                    nr+=(1LL<<p);
                p++;
            }
            st++;
        }
        cnt+=max(0,dr-st+1);
    }
    cout<<cnt;
    return 0;
}