#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e9+7;
const ll MOD = 998244353;
typedef pair<ll,ll> ii;
#define iii pair<ii,ll>
#define f(i,a,b) for(ll i = a;i < b;i++)
#define pb push_back
#define vll vector<ll>
#define F first
#define S second
#define all(x) (x).begin(), (x).end()
///I hope I will get uprating and don't make mistakes
///I will never stop programming
///sqrt(-1) Love C++
///Please don't hack me
///@TheofanisOrfanou Theo830
///Think different approaches (bs,dp,greedy,graphs,shortest paths,mst)
///Stay Calm
///Look for special cases
///Beware of overflow and array bounds
///Think the problem backwards
///Training
int main(void){
ios_base::sync_with_stdio(0);
cin.tie(0);
ll n,a,b;
cin>>n>>a>>b;
ll arr[n];
f(i,0,n){
cin>>arr[i];
}
set<ll> dp[n+1][b+1];
dp[0][0].insert(0);
f(i,0,n+1){
f(k,0,b){
if(k+1 <= b){
for(auto x:dp[i][k]){
ll sum = 0;
f(j,i,n){
sum += arr[j];
dp[j+1][k+1].insert(sum | x);
}
}
}
}
}
ll ans = 1e18;
f(i,a,b+1){
if(!dp[n][i].empty()){
auto it = dp[n][i].begin();
ans = min(ans,(*it));
}
}
cout<<ans<<"\n";
}
