#include <bits/stdc++.h>
using namespace std;
#define int long long
int dp[105][105], dp1[105][105][105];
void solve()
{
    int n, ll, rr;
    cin >> n >> ll >> rr;
    vector<int> v(n + 1), fore(n + 1);
    memset(dp, 0x3f, sizeof(dp));
    memset(dp1, 0x3f, sizeof(dp1));
    for (int i = 1; i <= n; i++)
    {
        cin >> v[i], fore[i] = fore[i - 1] + v[i], dp[i][i] = 0;
    }
    for (int len = 2; len <= n; len++)
    {
        for (int l = 1; l + len - 1 <= n; l++)
        {
            int r = l + len - 1;
            int nu[101][101];
            memset(nu, 0x3f, sizeof(nu));

            for (int tr = l; tr <= r; tr++)
                nu[tr][1] = min(nu[tr][1], dp[l][tr]);

            for (int tr = l + 1; tr <= r; tr++)
            {
                for (int tl = l; tl < tr; tl++)
                {
                    for (int tim = rr; tim > 1; tim--)
                    {
                        nu[tr][tim] = min(nu[tr][tim], nu[tl][tim - 1] + dp[tl + 1][tr]);
                    }
                }
            }
            // cout << nu[3][3] << endl;
            for (int tim = rr; tim >= ll; tim--)
                dp[l][r] = min(dp[l][r], nu[r][tim]);
            dp[l][r] += fore[r] - fore[l - 1];
            // cout << l << " " << r << " " << dp[l][r] << endl;
        }
    }

    cout << dp[1][n] << endl;
}
signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int T = 1;
    // cin >> T;
    while (T--)
        solve();
}