#include <bits/stdc++.h>
using namespace std;
int tab[151][151 * 151];
int main() {
  int n, k, s;
  scanf("%d%d%d", &n, &k, &s);
  for (int i = 0; i <= n; i++)
    for (int j = 0; j <= n * n; j++) tab[i][j] = 1000000009;
  tab[0][0] = 0;
  for (int i = 1; i <= n; i++) {
    int x;
    scanf("%d", &x);
    for (int j = i; j >= 1; j--)
      for (int l = n * n; l >= i - j; l--)
        tab[j][l] = min(tab[j][l], tab[j - 1][l - (i - j)] + x);
  }
  int wyn = 1000000009;
  for (int i = 0; i <= min(n * n, s); i++)
    if (tab[k][i] != 0) wyn = min(tab[k][i], wyn);
  printf("%d\n", wyn);
}
