#include <bits/stdc++.h>
using namespace std;
const int oo = 1000000000;
int N, K, S, f[155][155 * 155];
void solve() {
  for (int i = 0; i <= K; i++) {
    for (int j = 0; j <= N * N; j++) f[i][j] = oo;
  }
  f[0][0] = 0;
  for (int i = 1; i <= N; i++) {
    int a;
    scanf("%d", &a);
    for (int j = i; j >= 1; j--) {
      for (int k = i - j; k <= i * j; k++) {
        int cost = i - j;
        f[j][k] = min(f[j][k], f[j - 1][k - cost] + a);
      }
    }
  }
  int res = oo;
  int m = min(S, N * (N - 1) / 2);
  for (int i = 0; i <= m; i++) res = min(res, f[K][i]);
  printf("%d\n", res);
}
int main() {
  scanf("%d%d%d", &N, &K, &S);
  solve();
  return 0;
}
