#define wiwihorz
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("sse")
#pragma loop-opt(on)
#define rep(i, a, b) for(int i = a; i <= b; i ++)
#define rrep(i, a, b) for(int i = b; i >= a; i --)
#define all(x) x.begin(), x.end()
#define ceil(a, b) ((a + b - 1) / (b))
#define int long long int
#define lld long double
#define pii pair<int, int>
#define random mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count())
#define INF 1000000000000000000
#define MOD 1000000007
#define eps (1e-9)
using namespace std;
#ifdef wiwihorz
#define print(a...)cerr<<"Line "<<__LINE__<<":",kout("["+string(#a)+"] = ", a)
void vprint(auto L,auto R){while(L<R)cerr<<*L<<" \n"[next(L) == R], ++L; }
void kout() { cerr << endl; }
template<class T1,class ... T2>void kout(T1 a,T2 ... e){cerr<<a<<" ",kout(e...);}
#else
#define print(...) 0
#define vprint(...) 0
#endif
namespace solver1 {
int n, A, B;
const int P = 30;
vector<int> v;
vector<vector<int>> dp;
void init_(int _n, int _A, int _B) {
n = _n, A = _A, B = _B;
v.assign(n + 1, 0);
dp.assign(n + 1, vector<int>(n + 1, 0));
}
bool check(int id, int mask) {
dp.assign(n + 1, vector<int>(n + 1, 0));
dp[0][0] = 1;
int tot = (1 << P) - 1;
rep(i, 1, B) rep(j, 1, n) {
rep(k, 0, j - 1) if(dp[i - 1][k]){
int val = v[j] - v[k];
if(((val ^ tot) & mask) == mask) dp[i][j] = 1;
}
}
int ans = 0;
rep(i, A, B) ans |= dp[i][n];
return ans;
}
void solve() {
int ans = 0;
rep(i, 1, n) v[i] += v[i - 1];
rrep(i, 0, P - 1) ans |= check(i, ans | (1 << i)) << i;
int tot = (1 << P) - 1;
cout << (tot ^ ans) << "\n";
}
};
namespace solver2 {
};
signed main() {
ios::sync_with_stdio(false), cin.tie(0);
int n, A, B;
cin >> n >> A >> B;
if(A == 1 && n > 100) {
}
else {
solver1::init_(n, A, B);
rep(i, 1, n) cin >> solver1::v[i];
solver1::solve();
}
return 0;
}
