#include <limits>
#include <initializer_list>
#include <utility>
#include <bitset>
#include <tuple>
#include <type_traits>
#include <functional>
#include <string>
#include <array>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <iterator>
#include <algorithm>
#include <complex>
#include <random>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <sstream>
#include <regex>
#include <cassert>
#include <cstddef>
#include <variant>

#define endl codeforces

#define ALL(v) std::begin(v), std::end(v)
#define ALLR(v) std::rbegin(v), std::rend(v)

using ll = std::int64_t;
using ull = std::uint64_t;
using pii = std::pair<int, int>;
using tii = std::tuple<int, int, int>;
using pll = std::pair<ll, ll>;
using tll = std::tuple<ll, ll, ll>;
using size_type = ssize_t;
template <typename T> using vec = std::vector<T>;
template <typename T> using vvec = vec<vec<T>>;

template <typename T> const T& var_min(const T &t) { return t; }
template <typename T> const T& var_max(const T &t) { return t; }
template <typename T, typename... Tail> const T& var_min(const T &t, const Tail&... tail) { return std::min(t, var_min(tail...)); }
template <typename T, typename... Tail> const T& var_max(const T &t, const Tail&... tail) { return std::max(t, var_max(tail...)); }
template <typename T, typename... Tail> void chmin(T &t, const Tail&... tail) { t = var_min(t, tail...); }
template <typename T, typename... Tail> void chmax(T &t, const Tail&... tail) { t = var_max(t, tail...); }

template <typename T, std::size_t Head, std::size_t... Tail> 
struct multi_dim_array { using type = std::array<typename multi_dim_array<T, Tail...>::type, Head>; };

template <typename T, std::size_t Head> 
struct multi_dim_array<T, Head> { using type = std::array<T, Head>; };

template <typename T, std::size_t... Args> using mdarray = typename multi_dim_array<T, Args...>::type;

template <typename T, typename F, typename... Args> 
void fill_seq(T &t, F f, Args... args) { 
    if constexpr (std::is_invocable<F, Args...>::value) { 
        t = f(args...); 
    } else { 
        for (size_type i = 0; i < t.size(); i++) fill_seq(t[i], f, args..., i); 
    } 
}

template <typename T> vec<T> make_v(size_type sz) { return vec<T>(sz); }

template <typename T, typename... Tail> 
auto make_v(size_type hs, Tail&&... ts) { 
    auto v = std::move(make_v<T>(std::forward<Tail>(ts)...)); 
    return vec<decltype(v)>(hs, v); 
}

namespace init__ { 
struct InitIO { 
    InitIO() { 
        std::cin.tie(nullptr); 
        std::ios_base::sync_with_stdio(false); 
        std::cout << std::fixed << std::setprecision(30); 
    } 
} init_io; 
}

template <typename T>
T ceil_pow2(T bound) {
    T ret = 1;
    while (ret < bound) ret *= 2;
    return ret;
}

template <typename T>
T ceil_div(T a, T b) { return a / b + !!(a % b); }


struct Node {
    std::array<ll, 19> cnt;
    ll idx0, idx1;
    ll sum;

    Node() : idx0(-1), idx1(-1), sum(0) {
        std::fill(ALL(cnt), 0);
    }

    void init() {
        std::fill(ALL(cnt), 0);
        sum = 0;
    }
};

std::array<Node, 1ll << 20> nodes;
ll node_idx = 1;
auto root = &nodes[0];

Node* get_node(Node *cur, bool f) {
    if (!f) {
        if (cur->idx0 != -1) return &nodes[cur->idx0];
        else return nullptr;
    } else {
        if (cur->idx1 != -1) return &nodes[cur->idx1];
        else return nullptr;
    }
}

void insert(Node *cur, ll shift, ll num) {
    if (shift == -1) {
        cur->sum++;
        for (ll i = 0; i < 19; i++) {
            ll mask = 1ll << i;
            if (!(mask & num)) continue;
            cur->cnt[i]++;
        }
        return;
    }

    ll mask = 1ll << shift;
    if (!(num & mask)) {
        if (cur->idx0 == -1) cur->idx0 = node_idx++;
        insert(get_node(cur, 0), shift - 1, num);
    } else {
        if (cur->idx1 == -1) cur->idx1 = node_idx++;
        insert(get_node(cur, 1), shift - 1, num);
    }

    cur->init();

    auto merge = [&](Node *n) {
        if (!n) return;
        for (ll i = 0; i < 19; i++) cur->cnt[i] += n->cnt[i];
        cur->sum += n->sum;
    };

    merge(get_node(cur, 0));
    merge(get_node(cur, 1));
}

void insert(ll num) {
    insert(root, 18, num);
}

int main() {
    ll n, x;
    std::cin >> n >> x;

    vec<ll> av(n);
    for (ll &e : av) std::cin >> e;

    ll ans = 0;
    for (ll e : av) {
        std::array<ll, 19> cnt;
        std::fill(ALL(cnt), 0);
        ll sum = 0;
        auto cur = root;

        auto merge = [&](Node *n) {
            if (!n) return;
            for (ll i = 0; i < 19; i++) cnt[i] += n->cnt[i];
            sum += n->sum;
        };

        bool add = true;
        for (ll i = 18; 0 <= i; i--) {
            if (!cur) break;
            ll mask = 1ll << i;

            if (x & mask) {
                if (e & mask) {
                    merge(get_node(cur, 1));
                    cur = get_node(cur, 0);
                } else {
                    merge(get_node(cur, 0));
                    cur = get_node(cur, 1);
                }
            } else {
                if (e & mask) {
                    cur = get_node(cur, 1);
                } else {
                    cur = get_node(cur, 0);
                }
            }

            if (i == 0) add = false;
        }

        if (add) merge(cur);

        for (ll i = 0; i < 19; i++) {
            ll mask = 1ll << i;
            if (e & mask) chmax(cnt[i], sum);
            ans += mask * cnt[i];
        }

        insert(e);
    }

    std::cout << ans << "\n";
    return 0;
}