#include <bits/stdc++.h>
using namespace std;
bool debug = 0;
int n, m, k;
int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0};
long long ln, lk, lm;
int S, q[155];
int dp[2][155][155 * 155];
void fmain() {
  scanf("%d%d%d", &n, &k, &S);
  for (int(i) = 1; (i) <= (int)(n); (i)++) scanf("%d", q + i);
  int T = k * (k + 1) / 2 + S;
  int Len = (1 + n) * n / 2;
  for (int(i) = 0; (i) < (int)(2); (i)++)
    for (int(j) = 0; (j) < (int)(155); (j)++)
      for (int(z) = 0; (z) < (int)(Len + 1); (z)++) dp[i][j][z] = (1 << 30);
  dp[0][0][0] = 0;
  int t = 0;
  for (int(i) = 1; (i) <= (int)(n); (i)++) {
    int cur = t ^ 1, pre = t;
    for (int(j) = 0; (j) < (int)(155); (j)++)
      for (int(z) = 0; (z) < (int)(Len + 1); (z)++) dp[cur][j][z] = (1 << 30);
    for (int j = 0; j < i; j++) {
      for (int l = 0; l <= Len; l++)
        if (dp[pre][j][l] != (1 << 30)) {
          dp[cur][j][l] = min(dp[cur][j][l], dp[pre][j][l]);
          dp[cur][j + 1][l + i] =
              min(dp[cur][j + 1][l + i], dp[pre][j][l] + q[i]);
        }
    }
    t ^= 1;
  }
  int ans = (1 << 30);
  for (int z = 0; z <= min(T, Len); z++) ans = min(dp[t][k][z], ans);
  printf("%d\n", ans);
}
int main() {
  fmain();
  return 0;
}
