#include <bits/stdc++.h>
using namespace std;
const int N=2005;
long long arr[N];
long long mem1[N/10][N/10],sum[N];
long long mem2[N];
int n,a,b;
long long cans;
long long go(int ind,int gr)
{
if(ind>=n&&a<=gr&&gr<=b)
return 1;
if(ind>=n||gr>b)
return 0;
if(mem1[ind][gr]!=-1)
return mem1[ind][gr];
mem1[ind][gr]=0;
for(int i=ind;i<n;i++)
{
long long sm=sum[i]-(ind?sum[ind-1]:0);
if((sm&cans) > 0) continue;
if(cans<=8)
cout << sm << " " << cans << " " << (sm&cans) << endl;
mem1[ind][gr]|=go(i+1,gr+1);
}
return mem1[ind][gr];
}
int main()
{
cin >> n >> a >> b;
for(int i=0;i<n;i++)
cin >> arr[i];
/*if(n>100)
{
cout << "m3lsh" << endl;
}
else
{*/
long long ans=0;
for(int in=42;in>=0;in--)
{
memset(mem1,-1,sizeof mem1);
for(int i=0;i<n;i++)
sum[i]=arr[i]+(i?sum[i-1]:0);
cans|=(1LL<<in);
if(!go(0,0))
{
cans^=(1LL<<in);
ans|=(1LL<<in);
}
}
cout << ans << endl;
//}
}
