//g++ -o sol sol.cpp
//cd C:\Users\Asus-1\OneDrive\Desktop
#include <bits/stdc++.h>
using namespace std;
#define ld long double
#define int long long
const int INF=1e18;
#define S(a) a.begin(),a.end()
#define pb push_back
#define READ(l,r,a) for(int i=l;i<=r;i++) cin>>a[i]
#define printV(l,r,a) for(int i=l;i<=r;i++) cout<<a[i]<<' ';
#define pii pair <int,int>
#define FOR(i,l,r) for(int i=l;i<=r;i++)
int n,A,B;
int a[101];
int dp[101][101][2001];
void upd(int sub,int idx,int val){
if(val<2001) dp[sub][idx][val]=1;
}
void solve(){
cin>>n>>A>>B;
for(int i=1;i<=n;i++) cin>>a[i];
if(n<=20){
int res=INF;
for(int bit=0;bit<(1<<n);bit++){
int sum=0;
int OR=0;
int cnt=1;
bool ok=0;
for(int i=1;i<=n;i++){
sum+=a[i];
if((1<<(i-1))&bit){
if(i!=n)cnt++;
OR|=sum;
sum=0;
}
}
if(!(cnt>=A&&cnt<=B)) continue;
OR|=sum;
res=min(res,OR);
}
cout<<res<<endl;
return;
}
int sum=0;
for(int i=1;i<=n;i++){
sum+=a[i];
upd(1,i,sum);
}
dp[0][0][0]=1;
for(int sub=2;sub<=n;sub++){
for(int i=1;i<=n;i++){
int sum=0;
for(int j=i;j>=1;j--){
sum+=a[j];
for(int ii=0;ii<=2000;ii++) if(dp[sub-1][j-1][ii]==1) upd(sub,i,(ii|sum));
}
}
}
int res=INF;
for(int sub=A;sub<=B;sub++){
for(int ii=0;ii<=2000;ii++) if(dp[sub][n][ii]==1) res=min(res,ii);
}
cout<<res<<endl;
}
signed main(){
ios_base::sync_with_stdio();
cin.tie(0);
cout.tie(0);
int T=1;//cin>>T;
while(T--) solve();
}
