#include<bits/stdc++.h>
using namespace std;
#define ll long long
void solve(){
ll n,A,B;
cin>>n>>A>>B;
vector<ll> y(n);
for(ll a=0;a<n;a++){
cin>>y[a];
}
ll D=1e18;
for(ll a=0;a<(1<<(n-1));a++){
vector<ll> C;
C.push_back(0);
ll q=0;
for(ll b=0;b<n-1;b++){
if((a>>b)&1==1)
if(C.size()!=0){
if(B>=b+1-C.back() and b+1-C.back()>=A){
C.push_back(b+1);
}else{
q=1;
break;
}
}
}
if(B>=n-C.back() and n-C.back()>=A){
}else{
q=1;
}
if(q==1){
continue;
}
ll d=0,d1=0,i=0;
for(ll a=0;a<n;a++){
if(i!=C.size()){
if(C[i]==a){
d1|=d;
d=0;
i++;
}
}
d+=y[a];
}
d1|=d;
D=min(D,d1);
}
cout<<D<<endl;
}
signed main(){
ios::sync_with_stdio();
cin.tie(0);
cout.tie(0);
ll t=1;
// cin>>t;
for(ll a=0;a<t;a++){
solve();
}
}
