#include <bits/stdc++.h>
using namespace std;
const double pi = acos(-1);
const double eps = 1e-8;
const int maxn = 1e6 + 5;
const int maxm = 3e4 + 5;
const long long mod = 1e9 + 7;
const long long inf = 0x3f3f3f3f;
const int _inf = -1e9 + 7;
inline int scan() {
  int m = 0;
  char c = getchar();
  while (c < '0' || c > '9') c = getchar();
  while (c >= '0' && c <= '9') m = m * 10 + c - '0', c = getchar();
  return m;
}
int N, Q, S, M, K;
int num[200];
int dp[200][30000];
int main() {
  cin >> N >> K >> S;
  for (int i = 1; i <= N; i++) {
    scanf("%d", num + i);
  }
  memset(dp, inf, sizeof dp);
  dp[0][0] = 0;
  for (int i = 1; i <= N; i++) {
    for (int j = i - 1; j >= 0; j--) {
      for (int k = i * j; k >= 0; k--) {
        dp[j + 1][k + i - j - 1] =
            min(dp[j + 1][k + i - j - 1], dp[j][k] + num[i]);
      }
    }
  }
  int ans = inf;
  for (int i = 0; i <= min(S, N * N); i++) ans = min(ans, dp[K][i]);
  cout << ans;
  return 0;
}
