import core.bitop, std.algorithm, std.ascii, std.bigint, std.conv, std.math,
    std.functional, std.numeric, std.range, std.stdio, std.string, std.random,
    std.typecons, std.container, std.format;
static import std.ascii;

// dfmt off
T lread(T = long)(){return readln.chomp.to!T();}
T[] lreads(T = long)(long n){return generate(()=>readln.chomp.to!T()).take(n).array();}
T[] aryread(T = long)(){return readln.split.to!(T[])();}
void scan(TList...)(ref TList Args){auto line = readln.split();
foreach (i, T; TList){T val = line[i].to!(T);Args[i] = val;}}
alias sread = () => readln.chomp();enum MOD = 10 ^^ 9 + 7;
alias PQueue(T, alias less = "a<b") = BinaryHeap!(Array!T, less);
// dfmt on

void main()
{
    long N;
    ulong K;
    scan(N, K);
    auto A = aryread!ulong();
    auto dp = new ulong[][](2, 61);

    foreach_reverse (i; 0 .. 60)
    {
        ulong[2] cnt;
        foreach (j; 0 .. N)
        {
            cnt[0] += A[j] & (1UL << i);
            cnt[1] += (A[j] & (1UL << i)) ^ (1UL << i);
        }

        if (K & (1UL << i))
        {
            dp[0][i] = dp[0][i + 1] + cnt[1];
            dp[1][i] = dp[0][i + 1] + cnt[0];
            if (dp[1][i + 1])
                dp[1][i] = dp[1][i].max(dp[1][i + 1] + cnt[1], dp[1][i + 1] + cnt[0],);
        }
        else
        {
            dp[0][i] = dp[0][i + 1] + cnt[0];
            if (dp[1][i + 1])
                dp[1][i] = max(dp[1][i + 1] + cnt[1], dp[1][i + 1] + cnt[0]);
        }
    }
    // writeln(dp[0]);
    // writeln(dp[1]);
    max(dp[0][0], dp[1][0]).writeln();
}
