#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define piv pair<int,set<int>>
int N, A, B;
ll sum[2005], dp[2005][2005];
bool check(ll x) {
vector<piv> idx;
idx.push_back({0, {0}});
for(int i=1;i<=N;i++) {
set<int> tmp;
for(auto [j, s]:idx) {
ll ss = sum[i]-sum[j];
if((ss|x)==x && (ss&x)==ss) {
for(int ctt:s) if(ctt<B) tmp.insert(ctt+1);
}
}
if(!tmp.empty()) idx.push_back({i, tmp});
}
if(idx.back().first<N) return false;
for(int s:idx.back().second) if(s>=A && s<=B) return true;
return false;
}
int main() {
ios_base::sync_with_stdio(false); cin.tie(NULL);
cin>>N>>A>>B;
for(int i=1;i<=N;i++) cin>>sum[i], dp[i][0] = sum[i] += sum[i-1];
ll ans = (1ll<<51)-1;
for(int i=50;i>=0;i--) {
ans ^= (1ll<<i);
if(!check(ans)) {
ans ^= (1ll<<i);
}
}
cout<<ans;
}
