#include<bits/stdc++.h>
#define ll long long
#define co cout<<
using namespace std;
// stuff
void solve(){
ll n,l,r;
cin>>n>>l>>r;
ll arr[n+5];
for(int i=0;i<n;i++) cin>>arr[i];
ll ans=0;
for(int bit=30;bit>=0;bit--){
vector<ll>v[n+5];
for(int i=0;i<n;i++){
ll sum=0;
for(int j=i;j<n;j++){
sum+=arr[j];
if((sum|ans)>>bit==ans>>bit) v[i].push_back(j);
}
}
bitset<2001>curs[n+5];
curs[n][0]=1;
for(int i=n-1;i>=0;i--) for(auto j:v[i]) curs[i]|=curs[j+1]<<1;
bool good=0;
for(int i=l;i<=r;i++) if(curs[0][i]==1) good=1;
if(!good) ans|=1<<bit;
}
co ans;
}
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int _=1;
// cin>>_;
while(_--) solve();
}
