#include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define per(i, b, a) for (int i = b; i >= a; i--)
using namespace std;

const int P=998244353;
const int N=105,M=300005;

int n,L,R,a[N],sum[N];
int dp[N][N],f[N][N][N];

void umin(int &x,int y){if(y<x)x=y;}

int main() {
#ifdef xay5421
	freopen("a.in","r",stdin);
#endif
	cin>>n>>L>>R;
	rep(i,1,n)cin>>a[i],sum[i]=sum[i-1]+a[i];
	memset(dp,63,sizeof(dp));
	memset(f,63,sizeof(f));
	rep(i,1,n){
		f[i][i-1][0]=0;
	}
	rep(len,1,n){
		rep(l,1,n){
			int r=l+len-1;
			if(r>n)break;
			if(l==r){
				umin(dp[l][r],0);
			}
			if(len>=L&&len<=R){
				umin(dp[l][r],sum[r]-sum[l-1]);
			}
			rep(i,l,r){
				rep(k,1,R){
					umin(f[l][r][k],f[l][i-1][k-1]+dp[i][r]);
					if(k>=L){
						umin(dp[l][r],f[l][r][k]+sum[r]-sum[l-1]);
					}
				}
			}
		}
	}
	printf("%d\n",dp[1][n]<1e9?dp[1][n]:0);
	return 0;
}