#ifdef LOCAL
#include "local.h"
#else
#include <bits/stdc++.h>
#define debug(...)
#define DB(...)
#endif
using namespace std;
const bool __initialization = []() {
cin.tie(nullptr)->sync_with_stdio(false);
#define TASK "empty"
if (fopen(TASK".inp", "r")) {
(void)(!freopen(TASK".inp", "r", stdin));
(void)(!freopen(TASK".out", "w", stdout)); }
cout << setprecision(12) << fixed;
return true;
}();
using ll = long long;
using ld = long double;
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define For(i, l, r) for (int i = (l); i <= (r); ++i)
#define Ford(i, r, l) for (int i = (r); i >= (l); --i)
#define Rep(i, n) For (i, 0, (n) - 1)
#define Repd(i, n) Ford (i, (n) - 1, 0)
#define Fe(...) for (auto __VA_ARGS__)
template <class C> inline int isz(const C& c) { return static_cast<int>(c.size()); }
template <class T> inline bool chmin(T& a, const T& b) { return (a > b) ? a = b, true : false; }
template <class T> inline bool chmax(T& a, const T& b) { return (a < b) ? a = b, true : false; }
constexpr ld eps = 1e-9;
constexpr int inf = 1e9;
constexpr ll linf = 1e18;
// =============================================================================
constexpr int maxn = 2000 + 5;
int n, lo, hi;
int a[maxn];
ll pref[maxn];
struct Sub4 {
ll ans = (1LL << 41) - 1;
bool dp[maxn][maxn];
bool check(ll x) {
dp[0][0] = true;
For (i, 1, n) {
For (j, 1, min(i, hi)) {
dp[i][j] = false;
Ford (k, i - 1, 0) {
if (((pref[i] - pref[k]) | x) <= x && dp[k][j - 1]) {
dp[i][j] = true;
break;
}
}
}
}
For (i, lo, hi) {
if (dp[n][i]) return true;
}
return false;
}
void solve() {
Repd (i, 41) {
if (check(ans ^ (1LL << i))) {
ans ^= (1LL << i);
}
}
cout << ans << '\n';
}
};
struct Sub5 {
ll dp[maxn];
ll ans = (1LL << 41) - 1;
bool check(ll x) {
memset(dp + 1, 0x3f, sizeof(ll) * n);
For (i, 1, n) {
Ford (j, i - 1, 0) {
if (((pref[i] - pref[j]) | x) <= x) {
chmin(dp[i], dp[j] + 1);
}
}
}
return dp[n] <= hi;
}
void solve() {
Repd (i, 41) {
if (check(ans ^ (1LL << i))) {
ans ^= (1LL << i);
}
}
cout << ans << '\n';
}
};
signed main() {
cin >> n >> lo >> hi;
For (i, 1, n) {
cin >> a[i];
pref[i] = pref[i - 1] + a[i];
}
if (lo == 1) {
make_unique<Sub5>()->solve();
}
else {
make_unique<Sub4>()->solve();
}
}
