#include <bits/stdc++.h>
using namespace std;
long long n, k, s, dp[151][7000], a[160], mn = 1e9;
int main() {
  cin >> n >> k >> s;
  for (long long i = 1; i < n + 1; i++) cin >> a[i];
  s = min(s, n * (n + 1) / 2);
  for (long long i = 0; i < k + 1; i++) {
    for (long long j = 0; j < s + 1; j++) dp[i][j] = 1e12;
  }
  dp[0][0] = 0;
  for (long long i = 1; i < n + 1; i++) {
    for (long long j = min(i, k); j >= 1; j--) {
      for (long long l = s; l >= i - j; l--) {
        dp[j][l] = min(dp[j][l], dp[j - 1][l - (i - j)] + a[i]);
        if (l >= 1) dp[j][l] = min(dp[j][l], dp[j][l - 1]);
        if (j == k) mn = min(mn, dp[j][l]);
      }
    }
  }
  cout << mn;
}
