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;

// 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()
{
    ulong N;
    ulong K;
    scan(N, K);
    auto A = aryread!ulong();
    auto cnt = new long[](64);
    foreach (i; 0 .. 64)
    {
        foreach (a; A)
        {
            cnt[i] += (a & (1UL << i)) != 0;
        }
    }
    auto dp = new long[][](2, 65);
    dp[0][] = -1;
    dp[1][] = -1;
    dp[0][$ - 1] = 0;
    bool b;
    // writefln("%064b", K);
    // foreach (a; A)
    //     writefln("%064b", a);
    foreach_reverse (i; 1 .. 65)
    {
        dp[0][i - 1] = dp[0][i] * 2UL + cnt[i - 1];
        if (0 <= dp[1][i])
            dp[0][i - 1] = max(dp[0][i - 1], dp[1][i] * 2UL + cnt[i - 1]);
        if (K & (1UL << (i - 1)))
        {
            b = true;
        }
        if (b)
        {
            // writeln(i);
            dp[1][i - 1] = dp[0][i] * 2UL + N - cnt[i - 1];
            if (K & (1UL << (i - 1)) && 0 <= dp[1][i])
                dp[1][i - 1] = max(dp[1][i - 1], dp[1][i] * 2 + N - cnt[i - 1]);
        }
    }
    writeln(max(dp[0][0], dp[1][0]));
}
