#include <bits/stdc++.h>
#pragma GCC optimize("O2")
using namespace std;
inline long long int input() {
  long long int n;
  cin >> n;
  return n;
}
long long int poww(long long int a, long long int b, long long int md) {
  return (!b ? 1
             : (b & 1 ? a * poww(a * a % md, b / 2, md) % md
                      : poww(a * a % md, b / 2, md) % md));
}
const long long int MAXN = 2e5 + 10;
const long long int MAXA = 170;
const long long int INF = 8e18;
const long long int MOD = 1e9 + 7;
const long double PI = 4 * atan((long double)1);
long long int dp[MAXA][MAXA * MAXA], a[MAXN];
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  ;
  mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
  ;
  long long int n, k, s;
  cin >> n >> k >> s;
  for (long long int i = 0; i < n; i++) cin >> a[i];
  if (s * 2 > n * (n - 1)) {
    sort(a, a + n);
    long long int ans = 0;
    for (long long int i = 0; i < k; i++) {
      ans += a[i];
    }
    return cout << ans << '\n', 0;
    ;
  }
  for (long long int i = 0; i < n; i++) {
    for (long long int j = 1; j <= s; j++) {
      dp[i][j] = INF;
    }
  }
  dp[0][0] = a[0];
  for (long long int i = 1; i < n; i++) dp[i][0] = dp[i - 1][0] + a[i];
  for (long long int i = 0; i < n; i++) {
    for (long long int j = i; j >= 0; j--) {
      for (long long int p = 1; p <= s; p++) {
        dp[j][p] = min(dp[j][p], dp[j][p - 1]);
        if (p - i + j >= 0) {
          if (!j) {
            dp[j][p] = min(dp[j][p], a[i]);
          } else {
            dp[j][p] = min(dp[j][p], dp[j - 1][p - i + j] + a[i]);
          }
        }
      }
    }
  }
  cout << dp[k - 1][s] << '\n';
  return 0;
}
