#include <algorithm>
#include <bitset>
#include <stdio.h>
#include <vector>
typedef long long llt;
typedef unsigned uint;typedef unsigned long long ullt;
typedef bool bol;typedef char chr;typedef void voi;
typedef double dbl;
template<typename T>bol _max(T&a,T b){return(a<b)?a=b,true:false;}
template<typename T>bol _min(T&a,T b){return(b<a)?a=b,true:false;}
template<typename T>T lowbit(T n){return n&-n;}
template<typename T>T gcd(T a,T b){return b?gcd(b,a%b):a;}
template<typename T>T lcm(T a,T b){return(a!=0||b!=0)?a/gcd(a,b)*b:(T)0;}
template<typename T>T exgcd(T a,T b,T&x,T&y){if(b!=0){T ans=exgcd(b,a%b,y,x);y-=a/b*x;return ans;}else return y=0,x=1,a;}
template<typename T>T power(T base,T index,T mod)
{
    T ans=1%mod;
    while(index)
    {
        if(index&1)ans=ans*base%mod;
        base=base*base%mod,index>>=1;
    }
    return ans;
}
typedef std::bitset<105>BIT;
const uint Lim=41;
BIT B[105],User;
ullt S[2005];
int main()
{
#ifdef MYEE
    freopen("QAQ.in","r",stdin);
#endif
    uint n,a,b;scanf("%u%u%u",&n,&a,&b);
    for(uint i=1;i<=n;i++)scanf("%llu",S+i),S[i]+=S[i-1];
    if(a>1){
        ullt ans=0,w=0;
        for(uint bit=Lim-1;~bit;bit--){
            w|=1llu<<bit;
            for(uint i=0;i<=b;i++)B[i]=BIT();
            B[0][0]=1;
            for(uint i=1;i<=n;i++){
                for(uint j=0;j<i;j++)User[j]=!((S[i]-S[j])&w);
                for(uint j=b;j;j--)B[j][i]=(User&B[j-1]).any();
            }
            bol ok=false;
            for(uint i=a;i<=b;i++)ok|=B[i][n];
            if(!ok)ans^=1llu<<bit,w^=1llu<<bit;
        }
        printf("%llu\n",ans);
    }
    else{
        ullt ans=0,w=0;
        for(uint bit=Lim-1;~bit;bit--){
            w|=1llu<<bit;
            static uint W[2005];
            for(uint i=1;i<=n;i++){W[i]=1e9;for(uint j=0;j<i;j++)if(!((S[i]-S[j])&w))_min(W[i],W[j]+1);}
            if(W[n]>b)ans^=1llu<<bit,w^=1llu<<bit;
        }
        printf("%llu\n",ans);
    }
    return 0;
}