#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, k, s;
  cin >> n >> k >> s;
  vector<int> A(n);
  for (int i = 0; i < n; ++i) cin >> A[i];
  vector<int> vi(n * n, 1e9);
  vector<vector<int> > DP(k + 2, vi);
  DP[0][0] = 0;
  for (int i = 0; i < n; ++i) {
    vector<vector<int> > NDP(k + 2, vi);
    for (int j = 0; j <= i && j <= k; ++j) {
      int cnt = min(s, (i - j) * j);
      for (int c = 0; c <= cnt; ++c) {
        if (DP[j][c] == 1e9) continue;
        NDP[j][c] = min(NDP[j][c], DP[j][c]);
        NDP[j + 1][c + (i - j)] = min(NDP[j + 1][c + (i - j)], DP[j][c] + A[i]);
      }
    }
    for (int j = 0; j <= i + 1 && j <= k; ++j) {
      int cnt = min(s, (i + 1 - j) * j);
      for (int c = 0; c <= cnt; ++c) {
        DP[j][c] = NDP[j][c];
      }
    }
  }
  int ans = 1e9;
  int cnt = min(s, (n - k) * k);
  for (int c = 0; c <= cnt; ++c) {
    ans = min(ans, DP[k][c]);
  }
  cout << ans << endl;
  return 0;
}
