#include <bits/stdc++.h>
using namespace std;
int N, M, S;
int A[155];
int ans;
int dp[155][50000];
int main() {
  ios_base::sync_with_stdio(0), cin.tie(0);
  cin >> N >> M >> S;
  for (int i = 0; i < N; i++) cin >> A[i];
  if (S > N * (N - 1) / 2) {
    sort(A, A + N);
    for (int i = 0; i < M; i++) ans += A[i];
    cout << ans << '\n';
    return 0;
  }
  S += M * (M - 1) / 2;
  for (int i = 0; i <= M; i++)
    for (int j = 0; j <= S; j++) dp[i][j] = 999999999;
  dp[0][0] = 0;
  for (int i = 0; i < N; i++) {
    for (int j = i; j >= 0; j--) {
      if (j >= M) continue;
      for (int k = 0; k + i <= S && k <= i * (i - 1) / 2; k++)
        if (dp[j + 1][k + i] > dp[j][k] + A[i])
          dp[j + 1][k + i] = dp[j][k] + A[i];
    }
  }
  ans = 999999999;
  for (int i = 0; i <= S; i++)
    if (ans > dp[M][i]) ans = dp[M][i];
  cout << ans << '\n';
  return 0;
}
