#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N = 2001;
int dp[N];
int s[N], A[N];
vector<int> vals[N][2];
int32_t main(){
int n, a, b;
cin >> n >> a >> b;
vals[0][0].push_back(0);
for(int i = 1; i <= n; i++) cin >> A[i], s[i] = s[i - 1] + A[i];
int ans = (1LL << 60);
for(int k = 1; k <= n; k++){
for(int i = k; i <= n; i++){
vals[i][k % 2].clear();
for(int j = 0; j < i; j++){
for(auto v : vals[j][(k + 1) % 2]){
vals[i][k % 2].push_back(v | (s[i] - s[j]));
}
}
sort(vals[i][k % 2].begin(), vals[i][k % 2].end());
vals[i][k % 2].resize(unique(vals[i][k % 2].begin(), vals[i][k % 2].end()) - vals[i][k % 2].begin());
}
if(k >= a && k <= b){
ans = min(ans, vals[n][k % 2].front());
}
// for(auto j : vals[i]) cout << j << ' '; cout << endl;
}
cout << ans << endl;
}
