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

#define all(x) begin(x), end(x)
#ifdef CKISEKI
#define safe cerr << __PRETTY_FUNCTION__ << " line " << __LINE__ << " safe\n"
#define debug(a...) debug_(#a, a)
#define orange(a...) orange_(#a, a)
void debug_(auto s, auto ...a) {
  cerr << "\e[1;32m(" << s << ") = (";
  int f = 0;
  (..., (cerr << (f++ ? ", " : "") << a));
  cerr << ")\e[0m\n";
}
#include <experimental/iterator>
void orange_(auto s, auto L, auto R) {
  cerr << "\e[1;33m[ " << s << " ] = [ ";
  using namespace experimental;
  copy(L, R, make_ostream_joiner(cerr, ", "));
  cerr << " ]\e[0m\n";
}
#else
#define safe ((void)0)
#define debug(...) safe
#define orange(...) safe
#endif

const int maxn = 105;
int dp[maxn][maxn][maxn];
int dp2[maxn][maxn];

int main() {
  cin.tie(nullptr)->sync_with_stdio(false);
  int n;
  cin >> n;

  int L, R;
  cin >> L >> R;

  vector<int> a(n), pre(n + 1);
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    pre[i + 1] = pre[i] + a[i];
  }

  const int inf = 1e9;
  for (int l = 0; l <= n; l++)
    for (int r = 0; r <= n; r++) {
      for (int c = 0; c <= n; c++)
        dp[l][r][c] = inf;
      dp2[l][r] = inf;
    }

  for (int l = 0; l <= n; l++)
    dp[l][l][0] = 0;
  for (int l = 0; l < n; l++)
    dp[l][l + 1][1] = dp2[l][l + 1] = 0;

  for (int l = n - 1; l >= 0; l--) {
    for (int r = l + 1; r <= n; r++) {
      for (int c = 1; c <= r - l; c++) {
        for (int k = l + 1; k <= r; k++) {
          dp[l][r][c] = min(dp[l][r][c], dp2[l][k] + dp[k][r][c - 1]);
        }
        if (c >= L && c <= R)
          dp2[l][r] = min(dp2[l][r], dp[l][r][c] + pre[r] - pre[l]);
      }
    }
  }

  if (dp2[0][n] == inf) {
    cout << 0 << '\n';
  } else {
    cout << dp2[0][n] << '\n';
  }


  return 0;
}