#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define _GLIBCXX_DEBUG
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
ll ILL=1167167167167167167;
const int INF=2100000000;
const ll mod=998244353;
#define rep(i,a) for (int i=0;i<a;i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";}
template<class T> void vec_out(vector<T> &p){for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}

ll calc(vector<ll> &p){
	ll n=p.size();
	vector<ll> D(18,n);
	for(ll x:p){
		rep(i,18) if(x&(1<<i)) D[i]--;
	}
	ll ans=((1ll<<18)-1ll)*n*(n-1);
	ans/=2;
	rep(i,18){
		ans-=((1ll<<i))*((D[i]*(D[i]-1))/2);
	}
	return ans;
}
ll calc_2(vector<ll> &p,vector<ll> &q){
	ll n=p.size();
	ll ans=0;
	vector<ll> D(18);
	for(ll x:p){
		rep(i,18) if(x&(1<<i)) D[i]++;
	}
	for(ll x:q){
		rep(i,18){
			if(x&(1<<i)) ans+=n*(1ll<<i);
			else ans+=D[i]*(1ll<<i);
		}
	}
	return ans;
}
ll g(int D,ll X,vector<ll> &l,vector<ll> &r);
ll f(int D,ll X,vector<ll> &p);
void solve();
// oddloop
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
	int t=1;
	//cin>>t;
	rep(i,t) solve();
}

void solve(){
	ll N,X;
	cin>>N>>X;
	vector<ll> A(N);
	rep(i,N) cin>>A[i];
	cout<<f(18,X,A)<<"\n";
}
ll f(int D,ll X,vector<ll> &p){
	int n=p.size();
	if(D<0) return 0;
	if(n<2) return 0;
	vector<ll> l;
	vector<ll> r;
	rep(i,n){
		if(p[i]&(1<<D)){
			r.push_back(p[i]);
		}else l.push_back(p[i]);
	}
	if(X&(1<<D)){
		return calc(l)+calc(r)+g(D-1,X,l,r);
	}
	return f(D-1,X,r)+f(D-1,X,l);
}
ll g(int D,ll X,vector<ll> &l,vector<ll> &r){
	int n=l.size(),m=r.size();
	if(n==0||m==0||D==-1) return 0;
	vector<ll> l0,l1,r0,r1;
	rep(i,n){
		if(l[i]&(1<<D)) l1.push_back(l[i]);
		else l0.push_back(l[i]);
	}rep(i,m){
		if(r[i]&(1<<D)) r1.push_back(r[i]);
		else r0.push_back(r[i]);
	}
	if(X&(1<<D)){
		return calc_2(l0,r0)+calc_2(l1,r1)+g(D-1,X,l1,r0)+g(D-1,X,l0,r1);
	}
	return g(D-1,X,l0,r0)+g(D-1,X,l1,r1);
}