#include <bits/stdc++.h>
#pragma GCC optimize ("O2")
#pragma GCC optimize ("unroll-loops")
//#pragma GCC optimize("no-stack-protector,fast-math")
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<pii, int> piii;
typedef pair<ll, ll> pll;
#define debug(x) cerr<<#x<<'='<<(x)<<endl;
#define debugp(x) cerr<<#x<<"= {"<<(x.first)<<", "<<(x.second)<<"}"<<endl;
#define debug2(x, y) cerr<<"{"<<#x<<", "<<#y<<"} = {"<<(x)<<", "<<(y)<<"}"<<endl;
#define debugv(v) {cerr<<#v<<" : ";for (auto x:v) cerr<<x<<' ';cerr<<endl;}
#define all(x) x.begin(), x.end()
#define pb push_back
#define kill(x) return cout<<x<<'\n', 0;
const ld eps=1e-7;
const int inf=1000000010;
const ll INF=10000000000000010LL;
const int mod=1000000007;
const int MAXN=2010, LOG=41;
ll n, m, k, u, v, x, y, t, a, b, ans;
ll A[MAXN], ps[MAXN];
bool dp[MAXN][MAXN];
int dpp[MAXN];
bool check(ll OR){
if (n<=100){
dp[0][0]=1;
fill(dp[0]+1, dp[0]+b+1, 0);
for (int i=1; i<=n; i++) for (int j=1; j<=b; j++){
dp[i][j]=0;
for (int k=i-1; ~k && !dp[i][j]; k--)
if (((ps[i]-ps[k])|OR)==OR) dp[i][j]|=dp[k][j-1];
}
for (int i=a; i<=b; i++) if (dp[n][i]) return 1;
return 0;
}
dpp[0]=0;
for (int i=1; i<=n; i++){
dpp[i]=inf;
for (int j=i-1; ~j; j--)
if (((ps[i]-ps[j])|OR)==OR) dpp[i]=min(dpp[i], dpp[j]+1);
}
return dpp[n]<=b;
}
int main(){
ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
//freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
cin>>n>>a>>b;
for (int i=1; i<=n; i++) cin>>A[i], ps[i]=ps[i-1]+A[i];
ans=(1ll<<LOG)-1;
for (int i=LOG-1; ~i; i--) if (check(ans^(1ll<<i))) ans^=(1ll<<i);
cout<<ans<<'\n';
return 0;
}
