#include <bits/stdc++.h>
using namespace std;
const int N = 155;
int a[N], n, k, s, oo = 1e9, dp[N][N * N], ans;
int main() {
  cin >> n >> k >> s;
  for (int i = 1; i <= n; i++) cin >> a[i];
  s = min(s, n * (n - 1) / 2);
  for (int i = 0; i <= n; i++)
    for (int j = 0; j <= n * n; j++) dp[i][j] = oo;
  dp[0][0] = 0;
  for (int l = 1; l <= n; l++) {
    for (int i = l; i; i--) {
      for (int j = l - i; j <= i * n; j++) {
        dp[i][j] = min(dp[i][j], dp[i - 1][j - (l - i)] + a[l]);
      }
    }
  }
  ans = dp[k][0];
  for (int i = 0; i <= s; i++) ans = min(ans, dp[k][i]);
  cout << ans << endl;
}
