#include <stdio.h>
#include <vector>
#include <map>
#include <stdlib.h>

int main()
{
    int n, k;
    scanf("%d %d ", &n, &k);
    //int days[400001];
    int * days = (int*) malloc(sizeof(int) * n+1);

    for (int i = 0; i < n; i++) 
    {
        scanf("%d ", days + i);
    }

    //std::vector<std::vector<int>> tempSums(n);
    std::map<int, std::map<int, int>> tempSums;

    for (int i = 0; i < n; i++)
    {
        //tempSums[i] = std::vector<int>(/*n-i+1*/);
        tempSums.emplace(i, std::map<int, int>());
    }

    int eligibleDays = 0;

    for (int i = 1; i <= n; i++) // pro kazdou i-tici
    {
        for (int j = 0; j < n - i + 1; j++) // kterych existuje n-i+1
        {
            int sum;
            if (i == 1){
                sum = days[j+i-1];
                //tempSums[j].emplace_back(sum);
                tempSums[j].emplace(i, sum);
            }
            else{
                try
                {
                    sum = tempSums.at(j).at(i-1);
                }
                catch(const std::exception& e)
                {
                    break;
                    //std::cerr << e.what() << '\n';
                }
                
                //sum = tempSums.at(j).at(i-1);
                //sum = tempSums[j][i-1];
            }
            sum |= days[j+i-1];
            tempSums[j].emplace(i, sum);

            if (sum == k)
            {
                eligibleDays++;
            }
        }
    }

    printf("%d\n", eligibleDays);
    free(days);
    return 0;
}