#include <bits/stdc++.h>
using namespace std;
const int N = 150 + 7;
int n, k, s;
int a[N], srt[N], psa[N], pss[N];
int dp[2][N][N * N];
int main() {
  cin >> n >> k >> s;
  for (int i = 1; i <= n; i++) cin >> a[i], srt[i] = i;
  sort(srt + 1, srt + n + 1);
  for (int i = 1; i <= n; i++)
    psa[i] = psa[i - 1] + a[i], pss[i] = pss[i - 1] + srt[i];
  if (s >= n * (n - 1) / 2) {
    sort(a + 1, a + n + 1);
    int res = 0;
    for (int i = 1; i <= k; i++) res += a[i];
    cout << res;
    return 0;
  }
  for (int i = 1; i <= n; i++)
    for (int j = 1; j <= min(i, k); j++)
      for (int h = 0; h <= s; h++) {
        if (i == j) {
          dp[i % 2][j][h] = psa[i];
        } else {
          dp[i % 2][j][h] = dp[(i - 1) % 2][j][h];
          if (h >= i - j)
            dp[i % 2][j][h] = min(dp[i % 2][j][h],
                                  dp[(i - 1) % 2][j - 1][h - (i - j)] + a[i]);
        }
      }
  cout << dp[n % 2][k][s];
  return 0;
}
