#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MAXN = 2e3 + 10;
ll y[MAXN], dp[MAXN];
ll s[MAXN];
int main(){
cin.tie(0)->sync_with_stdio(0);
int n, a, b; cin >> n >> a >> b;
for(int i=1; i<=n; i++){
cin >> y[i];
s[i] = s[i - 1] + y[i];
}
ll ans = 0, bits = 0;
for(int bit=45; bit>=0; bit--){
bits += (1LL << bit);
for(int i=1; i<=n; i++) dp[i] = 1e9;
for(int i=1; i<=n; i++){
for(int j=0; j<i; j++){
ll sum = s[i] - s[j];
if((sum & bits) != 0) continue;
dp[i] = min(dp[i], dp[j] + 1);
}
}
bits -= (1LL << bit);
if(dp[n] <= b){
bits += (1LL << bit);
} else ans += (1LL << bit);
}
cout << ans << "\n";
return 0;
}
