R=range
J=lambda:map(int,input().split())
N,K=J()
A=sorted(bin(n|1<<30)[3:]for n in J())+["1"*30]
B=[[0]for d in R(30)]
for d in R(30):
	for i in R(N+1):B[d]+=[B[d][-1]+(A[i][d]>'0')]
M=N*(N-1)>>1
p=[[[0,N],[0,N]]]
a=0
def D(v):return v[1]-v[0]
for d in R(30):
	m,q=0,[[],[]]
	for v in p:
		s=[]
		for l,r in v:
			i,k=l-1,r
			while i+1<k:
				j=(i+k)>>1
				if B[d][l]<B[d][j+1]:k=j
				else:i=j
			s+=[[[l,k],[k,r]]]
		m+=D(s[0][0])*D(s[1][1])+(v[0]!=v[1])*D(s[1][0])*D(s[0][1])
		for e in R(2):
			for f in R(2):
				if D(s[0][e])*D(s[1][f])*(v[0]!=v[1]or e<=f)>0:q[e!=f]+=[[s[0][e],s[1][f]]]
	if M<K+m:a,K,M,p=a*2|1,K-M+m,m,q[1]
	else:a,M,p=a*2,M-m,q[0]
print(a)