#pragma optimize("Bismillahirrahmanirrahim")
//█▀█─█──█──█▀█─█─█
//█▄█─█──█──█▄█─█■█
//█─█─█▄─█▄─█─█─█─█
//Allahuekber
//ahmet23 orz...
//Sani buyuk Osman Pasa Plevneden cikmam diyor.
//FatihSultanMehmedHan
//YavuzSultanSelimHan
//AbdulhamidHan
#define author tolbi
#include <bits/stdc++.h>
using namespace std;
template<typename X, typename Y> istream& operator>>(istream& in, pair<X,Y> &pr) {return in>>pr.first>>pr.second;}
template<typename X, typename Y> ostream& operator<<(ostream& os, pair<X,Y> pr) {return os<<pr.first<<" "<<pr.second;}
template<typename X> istream& operator>>(istream& in, vector<X> &arr) {for(auto &it : arr) in>>it; return in;}
template<typename X> ostream& operator<<(ostream& os, vector<X> arr) {for(auto &it : arr) os<<it<<" "; return os;}
template<typename X, size_t Y> istream& operator>>(istream& in, array<X,Y> &arr) {for(auto &it : arr) in>>it; return in;}
template<typename X, size_t Y> ostream& operator<<(ostream& os, array<X,Y> arr) {for(auto &it : arr) os<<it<<" "; return os;}
#define int long long
#define endl '\n'
#define vint(x) vector<int> x
#define deci(x) int x;cin>>x;
#define decstr(x) string x;cin>>x;
#define cinarr(x) for (auto &it : x) cin>>it;
#define coutarr(x) for (auto &it : x) cout<<it<<" ";cout<<endl;
#define sortarr(x) sort(x.begin(),x.end())
#define sortrarr(x) sort(x.rbegin(),x.rend())
#define det(x) cout<<"NO\0YES"+x*3<<endl;
#define INF LONG_LONG_MAX
#define rev(x) reverse(x.begin(),x.end());
#define ios ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define tol(bi) (1LL<<((int)(bi)))
const int MOD = 1e9+7;
mt19937 ayahya(chrono::high_resolution_clock().now().time_since_epoch().count());
int32_t main(){
ios;
int t=1;
int tno = 0;
if (!t) cin>>t;
while (t-(tno++)){
deci(n);deci(a);deci(b);
vint(arr(n));
cinarr(arr);
int LOG = 45;
vector<int> pref = arr;
for (int i = 1; i < n; i++){
pref[i]+=pref[i-1];
}
function<int(int,int)> query = [&](int l, int r)->int{
int hh = 0;
if (l) hh = pref[l-1];
return pref[r]-hh;
};
int ans = 0;
int rans = 0;
if (a==1){
vector<int> dp(n+1,0);
for (int bit = LOG-1; bit >= 0; bit--){
ans+=tol(bit);
rans+=tol(bit);
for (int l = n-1; l >= 0; l--){
dp[l]=MOD;
for (int r = l; r < n; r++){
if (!(query(l,r)&rans)){
dp[l]=min(dp[l],dp[r+1]+1);
}
}
}
if (dp[0]<=b) ans-=tol(bit);
else rans-=tol(bit);
}
}
else {
vector<vector<bitset<2001>>> dp(n+1,vector<bitset<2001>>(n+1));
for (int i = a; i <= b; i++){
dp[n][n][i]=1;
}
for (int bit = LOG-1; bit >= 0; bit--){
ans+=tol(bit);
rans+=tol(bit);
for (int r = n-1; r >= 0; r--){
for (int l = r; l >= 0; l--){
dp[l][r]=dp[l][r+1];
if (!(query(l,r)&rans)){
dp[l][r]|=dp[r+1][r+1]>>1;
}
}
}
if (dp[0][0][0]) ans-=tol(bit);
else rans-=tol(bit);
}
}
cout<<ans<<endl;
}
}
