#include <bits/stdc++.h>
using namespace std;
int dp[2][23000][152];
int n, s, m;
int a[151];
int main() {
  scanf("%d%d%d", &n, &m, &s);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &a[i]);
  }
  s = min(s, n * n);
  memset(dp, 0x3f, sizeof(dp));
  int h = 1;
  dp[h][0][0] = 0;
  for (int i = n; i >= 1; i--, h ^= 1) {
    for (int j = s; j >= 0; j--) {
      for (int k = 0; k <= m; k++) {
        dp[h ^ 1][j][k] = dp[h][j][k];
        if (k - 1 < 0 || j - (i - m + k - 1) < 0) continue;
        dp[h ^ 1][j][k] =
            min(dp[h ^ 1][j][k], dp[h][j - (i - m + k - 1)][k - 1] + a[i]);
      }
    }
    memset(dp[h], 0x3f, sizeof(dp[h]));
  }
  int ans = 999999999;
  for (int i = 0; i <= s; i++) {
    ans = min(ans, dp[h][i][m]);
  }
  printf("%d\n", ans);
  return 0;
}
