#include <bits/stdc++.h>
using namespace std;
const int maxn = 155;
int dp[2][maxn][maxn * maxn / 2];
int num[maxn];
int main() {
  int n, k, s;
  scanf("%d%d%d", &n, &k, &s);
  for (int i = 1; i <= n; i++) scanf("%d", &num[i]);
  int cur = 0;
  memset(dp[cur], -1, sizeof(dp[cur]));
  dp[cur][0][0] = 0;
  s = min((2 * n - k + 1) * k / 2, s + (k + 1) * k / 2);
  for (int i = 1; i <= n; i++) {
    cur ^= 1;
    memcpy(dp[cur], dp[cur ^ 1], sizeof(dp[cur]));
    for (int j = 1; j <= k; j++)
      for (int p = i; p <= s; p++) {
        if (dp[cur ^ 1][j - 1][p - i] != -1) {
          int tmp = dp[cur ^ 1][j - 1][p - i] + num[i];
          if (dp[cur][j][p] == -1)
            dp[cur][j][p] = tmp;
          else
            dp[cur][j][p] = min(tmp, dp[cur][j][p]);
        }
      }
  }
  int ans = 1e9;
  for (int i = 0; i <= s; i++)
    if (dp[cur][k][i] != -1) ans = min(ans, dp[cur][k][i]);
  printf("%d\n", ans);
  return 0;
}
