#include <bits/stdc++.h>
using namespace std;
const int N=5e5+10,M=1e3+10,Q=1e6+10;
int n,k,tot=0;
long long dp[M][M],a[N],b[N],c[Q];
void solve1()
{
    long long ans=0;
    for (int i=1;i<=n;i++)
    {
        for (int j=i;j<=n;j++) c[++tot]=b[j]^b[i-1];
    }
    sort(c+1,c+tot+1);
    for (int i=tot;i>=tot-k+1;i--) ans+=c[i];
    cout<<ans;
}
void solve2()
{
    cout<<"HS LOVE CCF";
}
int main() {
    freopen("xor.in","r",stdin);
    freopen("xor.out","w",stdout);
    ios::sync_with_stdio(0),cin.tie(0);
    cin>>n>>k;
    for (int i=1;i<=n;i++) cin>>a[i],b[i]=b[i-1]^a[i];
    if (n<=1000) solve1();
    else solve2();
}