#include <bits/stdc++.h>
using namespace std;
inline long long mod(long long n, long long m) {
  long long ret = n % m;
  if (ret < 0) ret += m;
  return ret;
}
long long gcd(long long a, long long b) {
  return (b == 0LL ? a : gcd(b, a % b));
}
long long exp(long long a, long long b, long long m) {
  if (b == 0LL) return 1LL;
  if (b == 1LL) return mod(a, m);
  long long k = mod(exp(a, b / 2, m), m);
  if (b & 1LL) {
    return mod(a * mod(k * k, m), m);
  } else
    return mod(k * k, m);
}
const long long N = 151;
long long dp[2][N][N * N], q[N];
const long long inf = 1e9;
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  long long n, k, s;
  cin >> n >> k >> s;
  for (long long i = 1; i <= n; i++) {
    cin >> q[i];
  }
  s = min(s, n * (n - 1) / 2 + 1);
  s += k * (k + 1) / 2;
  for (long long j = 0; j <= k; j++) {
    for (long long t = 0; t <= s; t++) {
      if (j == 0 and t == 0)
        dp[0][j][t] = 0;
      else
        dp[0][j][t] = inf;
    }
  }
  for (long long i = 1; i <= n; i++) {
    long long cur = i & 1;
    long long last = (cur ^ 1);
    for (long long j = 1; j <= k; j++)
      for (long long t = 0; t <= s; t++) dp[cur][j][t] = inf;
    for (long long j = 1; j <= k; j++) {
      for (long long t = 0; t <= s; t++) {
        dp[cur][j][t] = min(dp[cur][j][t], dp[last][j][t]);
        if (t - i >= 0)
          dp[cur][j][t] = min(dp[cur][j][t], q[i] + dp[last][j - 1][t - i]);
      }
    }
  }
  long long res = inf;
  for (long long i = 0; i <= s; i++) {
    res = min(res, dp[n & 1][k][i]);
  }
  cout << res << "\n";
}
