#include <bits/stdc++.h>
using namespace std;
int q[200], best[40000][200], n, k, s, N;
void read() {
  cin >> n >> k >> s;
  for (int i = 1; i <= n; i++) {
    cin >> q[i];
  }
  N = min(35000, s + k * (k + 1) / 2);
}
int solve() {
  for (int i = 0; i <= N; i++) {
    for (int j = 0; j <= k; j++) {
      best[i][j] = 1000000000;
    }
  }
  best[0][0] = 0;
  for (int poz = 1; poz <= n; poz++) {
    for (int i = N; i >= 1; i--) {
      for (int j = 1; j <= k; j++) {
        if (poz <= i) {
          best[i][j] = min(best[i - 1][j],
                           min(best[i][j], best[i - poz][j - 1] + q[poz]));
        }
      }
    }
  }
  int sol = 1000000000;
  for (int i = 1; i <= N; i++) {
    sol = min(sol, best[i][k]);
  }
  return sol;
}
int main() {
  read();
  int sol = solve();
  cout << sol;
  return 0;
}
