#include<bits/stdc++.h>
using namespace std;

const int MAXN = 105;
int dp[MAXN][MAXN][MAXN][MAXN];

void solve(int t){
    int n,L,R;
    cin>>n>>L>>R;
    
    vector<int> a(n);
    for(int i=0;i<n;i++){
        cin>>a[i];
        a[i]+=(i==0 ? 0 : a[i-1]);
    }
    
    auto sum = [&](int l,int r){
        return a[r-1]-(l==0 ? 0 : a[l-1]);
    };
    
    memset(dp,-1,sizeof(dp));
    
    const int inf = 10'000'000;
    auto f = [&](auto &f,int l,int r,int ind,int num)->int{
        if(num>R)return inf;
        if(l+1==r && num==0)return 0;
        if(dp[l][r][ind][num]!=-1)return dp[l][r][ind][num];
        
        int res=inf;
        
        
        //0 2 0 0
        //0 2 1 1
        //0 2 2 1
        
        if(ind==r){
            if(num+1>=L && num+1<=R){
                res = sum(l,r)+f(f,l,r,l+1,0);
            }
        }else{
            res = min({res,f(f,l,r,ind+1,num),f(f,l,ind,l+1,0)+sum(l,ind)+f(f,ind,r,ind+1,num+1)});
        }
        
        //cout<<l<<" "<<r<<" "<<ind<<" "<<num<<" "<<res<<"\n";
        return dp[l][r][ind][num]=res;
    };
    
    int ans = f(f,0,n,1,0);
    if(ans==inf)ans=0;
    cout<<ans<<"\n";
}

int main(){
    //ios::sync_with_stdio(false);
    //cin.tie(0);
    
    int t=1;
    //cin>>t;
    for(int i=1;i<=t;i++)solve(i);
    
    return 0;
}