#include <bits/stdc++.h>
using namespace std;
const int N = 151;
int dp[2][N][N * N], a[N], b[N];
int main(void) {
  ios::sync_with_stdio(false), cin.tie(0);
  int n, k, s;
  cin >> n >> k >> s;
  for (int i = 1; i <= n; ++i) {
    cin >> a[i];
    if (i > k) b[i - k] = a[i];
  }
  if (s >= n * n) {
    sort(a + 1, a + n + 1);
    int sum = 0;
    for (int i = 1; i <= k; ++i) sum += a[i];
    cout << sum << endl;
    return 0;
  }
  for (int i = 1; i <= k; ++i) {
    for (int j = 1; j <= n - k; ++j) {
      for (int l = 0; l <= s; ++l) {
        dp[i & 1][j][l] = max(dp[i & 1][j - 1][l], dp[!(i & 1)][j][l]);
        if (a[i] > b[j] && l >= j + k - i) {
          dp[i & 1][j][l] =
              max(dp[i & 1][j][l],
                  dp[!(i & 1)][j - 1][l - (j + k - i)] + a[i] - b[j]);
        }
      }
    }
  }
  int sum = 0;
  for (int i = 1; i <= k; ++i) sum += a[i];
  cout << sum - dp[k & 1][n - k][s] << endl;
  return 0;
}
