#include<bits/stdc++.h>
#ifdef LOCAL
#include "Essentials/algo/debug.h"
#else
#define debug(...) 69
#endif
using namespace std;
//#pragma GCC optimize("O3,unroll-loops")
//#pragma GCC target("lzcnt,popcnt")
//https://quera.org/profile/4dykhk
typedef long long ll;
typedef long double ldb;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
const int N = 2e3 + 23;
const int sq = 450;
const ll mod = 1e9+7; // 998244353
const int LOG = 63;
const ll inf = 1e9;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define F first
#define S second
#define pb push_back
#define ms(x,y) memset((x) , (y) , sizeof (x))
#define done return cout<<endl , 0;
#define kill(x) cout<<x<<endl, exit(0);
#define isIn(x,s,e) ((x) >= (s) && (x) <= e)
#define all(x) x.begin(),x.end()
#define sz(x) (int)x.size()
#define pc(x) __builtin_popcount(x)
#define ctz(x) __builtin_ctz(x)
#define MinHeap(x) priority_queue<x, vector<x> , greater<x> >
#define MaxHeap(x) priority_queue<x, vector<x>>
#define lc (v << 1)
#define rc ((v<<1) |1)
#define int ll
ll pw(ll a, ll b, ll md = mod){ll res = 1; while(b){if(b&1){res=(a*res)%md;}a=(a*a)%md;b>>=1;}return(res);}
int n;
int s,t;
int a[N];
int dp[N][N];
int pd[N];
bool check(int mask) {
for(int i = 0 ;i <= n ;i ++) for(int j = 0 ; j <= n ; j ++) dp[i][j] = false;
dp[0][0] = true;
for(int i=1; i<= n ; i++) {
for(int j = 1; j<= n ;j ++) {
int sum = 0;
for(int k = i; k >= 1; k --) {
sum += a[k];
if((sum & mask) == sum) {
dp[i][j] |= dp[k-1][j-1];
}
}
}
}
for(int i = s; i <= t; i ++) if(dp[n][i]) return true;
return false;
}
bool check1(int mask) {
for(int i = 0; i<= n ; i++) pd[i] = N;
pd[0] = 0;
for(int i = 1; i<= n ; i++) {
int sum = 0;
for(int k = i; k >= 1 ;k --) {
sum += a[k];
if((sum&mask) == sum) {
pd[i] = min(pd[k-1] + 1,pd[i]);
}
}
}
return pd[n] <= t;
}
int32_t main() {
cin.tie(nullptr)->sync_with_stdio(false);
cin>>n>>s>>t;
for(int i= 1; i<= n ; i++) cin>>a[i];
int ans=0;
for(int i = LOG-1; i>= 0; i --) {
int f = ans | ((1LL << i)-1);
if(s == 1) {
if(check1(f)) continue;
else {
ans |= (1LL << i);
}
continue;
}
if(check(f)) continue;
else {
ans |= (1LL<<i);
}
}
cout<<ans;
done;
}
