#include <bits/stdc++.h>
using namespace std;
int n, m, s;
int a[200];
int f[2][160][12000];
int main() {
  scanf("%d%d%d", &n, &m, &s);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &a[i]);
  }
  int mxsumidx = n * (n + 1) / 2;
  for (int j = 0; j <= m; j++) {
    for (int k = 0; k <= mxsumidx; k++) {
      f[(n + 1) & 1][j][k] = 1e9;
    }
  }
  int ans = 1e9;
  f[(n + 1) & 1][0][0] = 0;
  for (int i = n; i >= 1; i--) {
    for (int j = 0; j <= m; j++) {
      for (int k = 0; k <= mxsumidx; k++) {
        f[i & 1][j][k] = f[(i + 1) & 1][j][k];
        if (j >= 1 && k >= i - 1 && i >= 1) {
          f[i & 1][j][k] =
              min(f[i & 1][j][k], f[(i + 1) & 1][j - 1][k - i + 1] + a[i]);
        }
      }
    }
  }
  int c = min((m - 1) * m / 2 + s, mxsumidx);
  for (int k = 0; k <= c; k++) {
    ans = min(ans, f[1][m][k]);
  }
  printf("%d\n", ans);
  return 0;
}
