#include <algorithm>
#include <iostream>
#include <vector>
#include <set>
#include <map>

using namespace std;
using ll = long long;
const int N = 105;
const ll INF = 1e18 + 123;

int a[N], p[N], u[N][N][N]; 
ll dp[N][N][N];

int sum(int l, int r) {
	return p[r] - p[l - 1];
}

	int n, L, R;
ll solve(int l, int r, int x) {
	if (u[l][r][x]) return dp[l][r][x];
	if (r - l + 1 == x) return 0;
	u[l][r][x] = 1;
	dp[l][r][x] = INF;
	if (x == 1) {
		for (int y = L ; y <= R ; ++ y) {
			dp[l][r][x] = min(dp[l][r][x], solve(l, r, y) + sum(l, r));
		}
	} else {
		for (int k = l ; k < r ; ++ k) {
			for (int y = 1 ; y < x ; ++ y) {
				dp[l][r][x] = min(dp[l][r][x], solve(l, k, y) + solve(k + 1, r, x - y));
			}
		}
	}
	return dp[l][r][x];
}

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cin >> n >> L >> R;
	for (int i = 1 ; i <= n ; ++ i) {
		cin >> a[i];
		p[i] = p[i - 1] + a[i];
	}
	ll ans = solve(1, n, 1);
	if (ans >= INF) ans = 0;
	cout << ans;
}