#include <bits/stdc++.h>
using namespace std;
#define OPTM ios_base::sync_with_stdio(0); cin.tie(0);
#define INF int(1e9+7)
#define ln '\n'
#define ll long long
#define ull unsigned long long
#define ui unsigned int
#define us unsigned short
#define FOR(i,s,n) for (int i = s; i < n; i++)
#define FORR(i,n,s) for (int i = n; i > s; i--)
#define FORX(u, arr) for (auto u : arr)
#define PB push_back
#define in(v,x) (v.find(x) != v.end())
#define F first
#define S second
#define PII pair<int, int>
#define PLL pair<ll, ll>
#define UM unordered_map
#define US unordered_set
#define PQ priority_queue
#define ALL(v) v.begin(), v.end()
const ll LLINF = 1e18+1;
#define int long long
const int MAXN = 2e3+1, LOG = 45;
int n,A,B;
int a[MAXN], p[MAXN], res[LOG];
bool dp[MAXN][MAXN], valid[MAXN][MAXN];
int dp1[MAXN];
void lolwhat() {
dp[0][0] = 1;
FOR(i,0,n) FOR(j,i,n) valid[i][j] = 1;
FORR(k,LOG-1,-1) {
FOR(i,0,n+1) {
FOR(j,1,n+1) dp[i][j] = 0;
}
FOR(j,0,n) {
FOR(i,0,n+1) {
FOR(l,i+1,n+1) {
int sum = p[l]-p[i];
bool val = sum&(1LL<<(k));
dp[l][j+1] = dp[l][j+1] || (dp[i][j] && valid[i][l-1] && !val);
}
}
}
res[k] = 1;
FOR(x,A,B+1) {
if (dp[n][x]) res[k] = 0;
}
FOR(i,0,n) {
FOR(j,i,n) {
int sum = p[j+1]-p[i];
bool val = sum&(1LL<<(k));
if (val && !res[k]) valid[i][j] = 0;
}
}
}
int ans = 0, cur = 1;
FOR(k,0,LOG+1) {
ans += cur*res[k];
cur *= 2;
}
cout << ans;
}
void lolbruh() {
dp1[0] = 0;
FOR(i,0,n) FOR(j,i,n) valid[i][j] = 1;
FORR(k,LOG-1,-1) {
FOR(i,1,n+1) dp1[i] = LLINF;
FOR(i,0,n+1) {
FOR(l,i+1,n+1) {
int sum = p[l]-p[i];
bool val = sum&(1LL<<(k));
if (valid[i][l-1] && !val) {
dp1[l] = min(dp1[l], dp1[i]+1);
}
}
}
res[k] = dp1[n] <= B ? 0 : 1;
FOR(i,0,n) {
FOR(j,i,n) {
int sum = p[j+1]-p[i];
bool val = sum&(1LL<<(k));
if (val && !res[k]) valid[i][j] = 0;
}
}
}
int ans = 0, cur = 1;
FOR(k,0,LOG+1) {
ans += cur*res[k];
cur *= 2;
}
cout << ans;
}
signed main() {
OPTM;
cin >> n >> A >> B;
FOR(i,0,n) cin >> a[i];
FOR(i,1,n+1) p[i] = p[i-1]+a[i-1];
if (A == 1) lolbruh();
else lolwhat();
}
