//https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8 より
macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
    ($($r:tt)*) => {
        let s = {
            use std::io::Read;
            let mut s = String::new();
            std::io::stdin().read_to_string(&mut s).unwrap();
            s
        };
        let mut iter = s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
}

macro_rules! input_inner {
    ($iter:expr) => {};
    ($iter:expr, ) => {};
    ($iter:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($iter, $t);
        input_inner!{$iter $($r)*}
    };
}

macro_rules! read_value {
    ($iter:expr, ( $($t:tt),* )) => {
        ( $(read_value!($iter, $t)),* )
    };
    ($iter:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($iter, $t)).collect::<Vec<_>>()
    };
    ($iter:expr, chars) => {
        read_value!($iter, String).chars().collect::<Vec<char>>()
    };
    ($iter:expr, bytes) => {
        read_value!($iter, String).bytes().collect::<Vec<u8>>()
    };
    ($iter:expr, usize1) => {
        read_value!($iter, usize) - 1
    };
    ($iter:expr, $t:ty) => {
        $iter.next().unwrap().parse::<$t>().expect("Parse error")
    };
}

//

fn sum(a: &[u64], b: &[u64]) -> u64 {
    let mut cnt = [0; 18];
    for &b in b.iter() {
        for (i, c) in cnt.iter_mut().enumerate() {
            *c += (b >> i as u64) & 1;
        }
    }
    let all = b.len() as u64;
    let mut ans = 0;
    for &a in a.iter() {
        for (i, c) in cnt.iter().enumerate() {
            let i = i as u64;
            if a >> i & 1 == 1 {
                ans += all << i;
            } else {
                ans += *c << i;
            }
        }
    }
    ans
}

// a xor b < x なペアの a | b の和を返す
// a, bはソート済み, 任意のペアについて (a ^ b) >> w == x >> w
fn calc(a: &[u64], b: &[u64], w: u64, x: u64) -> u64 {
    if a.is_empty() || b.is_empty() || w == 0 {
        return 0;
    }
    let w = w - 1;
    let (al, ar) = {
        let mut k = 0;
        while k < a.len() && a[k] >> w & 1 == 0 {
            k += 1;
        }
        a.split_at(k)
    };
    let (bl, br) = {
        let mut k = 0;
        while k < b.len() && b[k] >> w & 1 == 0 {
            k += 1;
        }
        b.split_at(k)
    };
    let mut res = 0;
    if x >> w & 1 == 1 {
        res += sum(al, bl);
        res += sum(ar, br);
        res += calc(al, br, w, x);
        res += calc(ar, bl, w, x);
    } else {
        res += calc(al, bl, w, x);
        res += calc(ar, br, w, x);
    }
    res
}

fn run() {
    input! {
        n: usize,
        x: u64,
        a: [u64; n],
    }
    let mut a = a;
    a.sort();
    let mut ans = calc(&a, &a, 19, x);
    for a in a {
        ans -= a;
    }
    ans /= 2;
    println!("{}", ans);
}

fn main() {
    run();
}