#include<bits/stdc++.h>
#define fi first
#define se second
using namespace std;
typedef long long ll;
typedef vector<ll> vi;
typedef vector<ll> vl;
const int N=2e3+10;
int dp[N];
int dp2[N][N],t[N];
ll sum[N][N];
int n,a,b;
int single(ll curr){
for(int i=n;i>=1;i--){
ll sum=0;
dp[i]=n+1;
for(int j=i;j<=n;j++){
sum+=t[j];
if((sum|curr)==curr) dp[i]=min(dp[i],dp[j+1]+1);
}
}
return dp[1];
}
void solve(){
cin>>n>>a>>b;
for(int i=1;i<=n;i++) cin>>t[i];
if(a==1){
ll curr=(1LL<<50)-1;
for(int i=49;i>=0;i--) if(single(curr-(1LL<<i))<=b) curr-=(1LL<<i);
cout<<curr<<"\n";
}
}
int main(){
ios_base::sync_with_stdio(0),cin.tie(0);
solve();
}
