#include <bits/stdc++.h>
using namespace std;
int dp[151][22351];
int q[151];
int n, K, s;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cin >> n >> K >> s;
  for (int i = 1; i <= n; ++i) cin >> q[i];
  for (int i = 0; i <= n; ++i) {
    for (int j = 0; j <= 22350; ++j) dp[i][j] = 1e9;
  }
  dp[0][0] = 0;
  for (int i = 1; i <= n; ++i) {
    for (int j = i; j > 0; --j) {
      for (int k = (i * (i + 1)) / 2; k >= i; --k) {
        dp[j][k] = min(dp[j][k], dp[j - 1][k - i] + q[i]);
      }
    }
  }
  int cmp = 1e9;
  for (int i = 0; i <= min(1LL * 22350, s + (1LL * K * (K + 1)) / 2); ++i)
    if (cmp > dp[K][i]) cmp = dp[K][i];
  cout << cmp << endl;
  return 0;
}
