#include <bits/stdc++.h>
using namespace std;
#define N 500005
#define int long long
const int inf = INT_MAX;
const int M = 998244353;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
int n, a[N], B, A, b[N], ans = -1;
void solve(int x) {
if(x == n) {
int cnt = 0,sm = 0, vl = 0;
for(int i = 1; i <= n; i++) {
sm += a[i];
if(b[i]) {
vl |= sm;
sm = 0;
cnt++;
}
}
vl |= sm;
if(cnt > B || cnt < A) return;
if(ans == -1) ans = vl;
ans = min(ans, vl);
return;
}
b[x] = 1;
solve(x + 1);
b[x] = 0;
solve(x + 1);
}
signed main() {
ios::sync_with_stdio(0);cin.tie(0);
cin >> n >> A >> B;
for(int i = 1; i <= n; i++) {
cin >> a[i];
}
solve(1);
cout << ans << '\n';
return 0;
}
