#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define elif else if
#define sp(x) fixed << setprecision(x)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
const int MOD = 1000000007;
//const int MOD = 998244353;
const int inf = (1<<30)-1;
const ll INF = (1LL<<60)-1;
const double pi = acos(-1.0);
const double EPS = 1e-10;
template<typename T> bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;};
template<typename T> bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;};

int main(){
    int N, X;
    cin >> N >> X;
    ll ans = 0;
    vector<int> a(N);
    vector<int> cnt(1<<18, 0);
    rep(i, N){
        cin >> a[i];
        ans -= a[i], cnt[a[i]]++;
    }
    sort(all(a));
    vector<int> sum[N+1];
    rep(i, N+1){
        sum[i].assign(18, 0);
    }
    rep(i, N){
        rep(j, 18) sum[i+1][j] = sum[i][j]+((a[i]>>j)&1);
    }
    rep(i, 1<<18){
        if(cnt[i] == 0) continue;
        int y = 0;
        rep3(j, 17, 0){
            if((X>>j)&1){
                if((i>>j)&1) y |= 1<<j;
                int l = lower_bound(all(a), y)-a.begin();
                int r = lower_bound(all(a), y+(1<<j))-a.begin();
                rep(k, 18){
                    if((i>>k)&1) ans += (1LL<<k)*(r-l)*cnt[i];
                    else ans += (1LL<<k)*(sum[r][k]-sum[l][k])*cnt[i];
                }
                y ^= 1<<j;
            }
            else{
                if((i>>j)&1) y |= 1<<j;
            }
        }
    }
    cout << ans/2 << endl;
}