// Judges with GCC >= 12 only needs Ofast
// #pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
// MLE optimization
// #pragma GCC optimize("conserve-stack")
// Old judges
// #pragma GCC target("sse4.2,popcnt,lzcnt,abm,mmx,fma,bmi,bmi2")
// New judges. Test with assert(__builtin_cpu_supports("avx2"));
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
// Atcoder
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
- insert(x)
- find_by_order(k): return iterator to the k-th smallest element
- order_of_key(x): the number of elements that are strictly smaller
*/
#include<bits/stdc++.h>
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_real_distribution<> pp(0.0,1.0);
#define int long long
#define ld long double
#define pii pair<int,int>
#define piii pair<int,pii>
#define fi first
#define se second
const int inf=1e18;
const int mod=998244353;
const int maxn=2005;
const int bl=650;
const int maxs=650;
const int maxm=200005;
const int maxq=500005;
const int maxl=20;
const int maxa=10000000;
const int root=3;
int power(int a,int n){
int res=1;
while(n){
if(n&1) res=res*a%mod;
a=a*a%mod;n>>=1;
}
return res;
}
const int iroot=power(3,mod-2);
int n,a,b,x[maxn];
namespace sub5{
void solve(){
vector<int> dp(n+1,0);
auto check = [&](int p){
dp[0]=0;
for(int i=1;i<=n;i++){
dp[i]=n+1;
for(int j=0;j<i;j++){
int cost=x[i]-x[j];
if((p|cost)==p) dp[i]=min(dp[i],dp[j]+1);
}
}
return dp[n]<=b;
};
int res=(1LL<<41)-1;
for(int i=40;i>=0;i--){
if(check(res^1LL<<i)) res^=(1LL<<i);
}
cout << res << '\n';
}
}
namespace sub4{
bitset<105> dp[maxn];
void solve(){
auto check = [&](int p){
dp[0][0]=1;
for(int i=1;i<=n;i++){
dp[i].reset();
for(int j=0;j<i;j++){
int cost=x[i]-x[j];
if((p|cost)==p) dp[i]|=(dp[j]<<1);
}
}
int ok=0;
for(int i=a;i<=b;i++) ok|=dp[n][i];
return ok;
};
int res=(1LL<<41)-1;
for(int i=40;i>=0;i--){
if(check(res^1LL<<i)) res^=(1LL<<i);
}
cout << res << '\n';
}
}
void solve(){
cin >> n >> a >> b;
for(int i=1;i<=n;i++){cin >> x[i];x[i]+=x[i-1];}
if(a==1) sub5::solve();
else sub4::solve();
}
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);cout.tie(NULL);
int test=1;//cin >> test;
while(test--) solve();
}
