#include<iostream>
#include<vector>
#include<string>
#include<map>
#include<set>
#include<queue>
#include<algorithm>
#include<cmath>
#include<iomanip>
#include<random>
#include<stdio.h>
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
using P=pair<ll,ll>;

int main(){
    ll N,X;
    scanf("%lld",&N);
    scanf("%lld",&X);
    vector<ll> A(N);
    for (ll i=0;i<N;i++){
        scanf("%lld",&A[i]);
    }
    ll res=0;
    for (ll i=1;i<N;i++){
        for (ll j=0;j<i;j++){
            if ((A[i]^A[j])<X){
                res+=A[i]^A[j];
            }
        }
    }
    cout<<res<<endl;
}