#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define sz(a) (int)(a.size())
#define all(a) a.begin(),a.end()
#define lb lower_bound
#define ub upper_bound
#define owo ios_base::sync_with_stdio(0);cin.tie(0);
#define MOD (ll)(1e9+7)
#define INF (ll)(1e18)
#define debug(...) fprintf(stderr, __VA_ARGS__),fflush(stderr)
#define time__(d) for(long blockTime = 0; (blockTime == 0 ? (blockTime=clock()) != 0 : false);\
debug("%s time : %.4fs\n", d, (double)(clock() - blockTime) / CLOCKS_PER_SEC))
typedef long long int ll;
typedef long double ld;
typedef pair<ll,ll> PII;
typedef pair<int,int> pii;
typedef vector<vector<int>> vii;
typedef vector<vector<ll>> VII;
ll gcd(ll a,ll b){if(!b)return a;else return gcd(b,a%b);}
int main()
{
int n,a,b;
cin>>n>>a>>b;
vector<ll>y(n+1);
for(int i=1;i<=n;i++)cin>>y[i];
if(a!=1){
//O(n^3 * log(n*Y);
ll cur = 0;
for(ll bit=35;bit>=0;bit--){
vii dp(n+1,vector<int>(n+1,0));
dp[0][0] = 1;
for(int i=1;i<=n;i++){
ll sum = 0;
for(int j=i;j>0;j--){
sum+=y[j];
for(int k=1;k<=b;k++){
if(((cur|sum)>>bit) == (cur>>bit) && dp[j-1][k-1])dp[i][k] = 1;
}
}
}
bool ok = 0;
for(int i=a;i<=b;i++){
if(dp[n][i])ok = 1;
}
if(!ok){
//cout<<bit<<'\n';
cur+=(1LL<<bit);
}
}
cout<<cur<<'\n';
}else{
ll cur = 0;
for(ll bit = 45;bit>=0;bit--){
vector<int>dp(n+1,n+1);
dp[0] = 0;
for(int i=1;i<=n;i++){
ll sum =0;
for(int j=i;j>0;j--){
sum+=y[j];
if(((cur|sum)>>bit) == (cur>>bit) && dp[j-1] <b)dp[i] = min(dp[i],dp[j-1]+1);
}
}
if(dp[n] > b)cur+=(1LL<<bit);
}
cout<<cur<<'\n';
}
}
