#include <bits/stdc++.h>
using namespace std;
int const N = 222, M = 22222, INF = 1e9 + 100;
int n, k, s;
int a[N], ps[N], dp[2][N][M];
int32_t main() {
  ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
  memset(dp, 127, sizeof(dp));
  memset(dp[0][0], 0, sizeof(dp[0][0]));
  memset(dp[1][0], 0, sizeof(dp[1][0]));
  cin >> n >> k >> s;
  s = min(s, n * (n - 1) / 2);
  for (int i = 1; i <= n; i++) cin >> a[i], ps[i] = ps[i - 1] + a[i];
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= min(k, i); j++) {
      for (int l = 0; l <= s; l++) {
        int w = i & 1, e = 1 - w;
        if (!l) {
          dp[w][j][l] = ps[j];
        } else {
          dp[w][j][l] = INF;
          dp[w][j][l] =
              min((l - (i - j) >= 0 ? dp[e][j - 1][l - (i - j)] + a[i] : INF),
                  min(dp[w][j][l - 1], dp[e][j][l]));
        }
      }
    }
  }
  cout << dp[n & 1][k][s];
}
