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

#define fi first
#define se second
#define Mp make_pair
#define pb push_back
#define SZ(x) (int((x).size()))

typedef long long ll;
typedef double db;
typedef vector<int> vi;
typedef pair<int, int> pii;

const int maxn = 111;
ll a[maxn];
ll sum[maxn];
ll f[maxn][maxn][maxn];
ll g[maxn][maxn];
int n, L, R;
signed main() {
    memset(f, 0x3f, sizeof f);
    memset(g, 0x3f, sizeof g);
    cin >> n >> L >> R;
    for(int i = 1; i <= n; i++) {
        cin >> a[i];
        sum[i] = sum[i - 1] + a[i];
    }
    for(int i = 1; i <= n; i++)
        f[i][i][1] = 0;
    for (int len = 2; len <= n; len++) {
        for (int l = 1, r = l + len - 1; r <= n; l++, r++) {
            for(int k = 2; k <= R; k++) {
                for(int p = l; p < r; p++) {
                    f[l][r][k] = min(f[l][r][k], f[l][p][k - 1] + f[p + 1][r][1]);
                }
                if(L <= k) {
                    f[l][r][1] = min(f[l][r][1], f[l][r][k] + sum[r] - sum[l - 1]);
                }
            }
        }
    }
    if(f[1][n][1] == f[0][0][0]) {
        cout << "0\n";
    } else {
        cout << f[1][n][1] << '\n';
    }
    return 0;
}