#include<bits/stdc++.h>
using namespace std;
using LL = long long;
#define rep(i,n) for(int i=0; i<(n); i++)

LL N, X;
LL C[1<<18][19]={};
LL ans[18]={};

int main(){
	cin>>N>>X;
	rep(i,N){
		int a; cin>>a;
		rep(j,18) if(!(a&(1<<j))) C[a][j]++;
		C[a][18]++;
	}

	rep(d,19){
		int D=1<<d;

		if(X&D){
			int DX=(X-D)&~(D-1);
			for (int i=0; i<1<<18; i+=D) rep(j,18) ans[j] += C[i][18]*C[i^DX][18]-C[i][j]*C[i^DX][j];
		}

		rep(i,1<<18){ if(i&D) rep(j,19) C[i-D][j]+=C[i][j]; }
	}

	LL ansS=0;
	rep(i,18) ansS += ((ans[i]-N+C[0][i])/2)<<i;
	cout<<ansS<<endl;

	return 0;
}