#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#include <list>
#define popcount __builtin_popcount
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
void FWT(vector<ll> &v){
	int m=v.size();
	for(int i=1; i<m; i<<=1){
		for(int j=0; j<m; j++){
			if((i&j)==0){
				ll x=v[j], y=v[j^i];
				v[j]=x+y, v[j^i]=x-y;
			}
		}
	}
}
int main()
{
	int n, x; cin>>n>>x;
	vector<ll> v(1<<18), vx(1<<18);
	ll ans=0;
	for(int i=0; i<n; i++){
		int a; cin>>a;
		v[a]++;
		vx[a]+=a;
		ans-=a;
	}
	FWT(v); FWT(vx);
	vector<ll> w(1<<18), wx(1<<18);
	for(int i=0; i<(1<<18); i++) w[i]=v[i]*v[i], wx[i]=vx[i]*v[i];
	FWT(w); FWT(wx);
	for(int i=0; i<(1<<18); i++) w[i]>>=18, wx[i]>>=18;
	for(int i=0; i<x; i++){
		ans+=w[i]*i/2+wx[i];
	}
	ans/=2;
	cout<<ans<<endl;
	return 0;
}