#include <bits/stdc++.h>

using namespace std;

#define rep(i, a, b) for(int i=a; i<b; i++)
#define all(x) begin(x), end(x)
#define sz(x) (int) (x).size()
#define fo(i, n) rep(i, 0, n)
#define F first
#define S second
#define MP make_pair
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;

int main() {
	cin.tie(0)->sync_with_stdio(0);
	cin.exceptions(cin.failbit);

	unsigned int n, k;
	cin >> n >> k;
	vector<unsigned int> a(n);
	fo(i, n) cin >> a[i];


	int logn = 0;
	while ((1 << logn) < n) logn++;

	vector<vector<unsigned int>> ors(logn+1, vector<unsigned int>(n, 0));
	for (int d=0; d<logn+1; d++) {
		for (int i=0; i<((int)n)-(1<<d)+1; i++) {
			if (d == 0) ors[d][i] = a[i];
			else ors[d][i] = ors[d-1][i] | ors[d-1][i+(1<<(d-1))];
		}
	}

	int i = 0, j = 0, w = 0;
	ll r = 0;
	while (j < n) {
		int d = 31 - __builtin_clz(j - i + 1);
		if (w < n && (a[w] | k) == k) {
			w++;
		} else if (j == w) {
			i = w+1;
			j = w+1;
			w = w+1;
		} else if ((i <= j) && (ors[d][i] | ors[d][j - (1 << d) + 1]) == k) {
			r += w - j;
			i++;
		} else {
			j++;
		}
	}
	cout << r << endl;
}