#include <bits/stdc++.h>
using namespace std;
const long long mod = 998244353;
const long long ba = 131;
long long qk(long long x, long long y) {
  long long ans = 1;
  while (y) {
    if (y & 1) ans = ans * x % mod;
    y >>= 1;
    x = x * x % mod;
  }
  return ans;
}
const int dx[8] = {0, -1, 0, 1, -1, -1, 1, 1},
          dy[8] = {-1, 0, 1, 0, -1, 1, -1, 1};
const int dxx[8] = {2, 1, -1, -2, -2, -1, 1, 2},
          dyy[8] = {1, 2, 2, 1, -1, -2, -2, -1};
int dp[155][155 * 155];
int n, k, s;
int a[155];
void solve() {
  cin >> n >> k >> s;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
  }
  memset(dp, 0x3f3f3f3f, sizeof dp);
  dp[0][0] = 0;
  for (int i = 1; i <= n; i++) {
    for (int j = i - 1; j >= 0; j--) {
      for (int p = 0; p <= i * j; p++) {
        if (dp[j][p] == 0x3f3f3f3f) continue;
        dp[j + 1][p + i - (j + 1)] =
            min(dp[j + 1][p + i - (j + 1)], dp[j][p] + a[i]);
      }
    }
  }
  int ans = 0x3f3f3f3f;
  for (int i = 0; i <= min(s, n * (n)); i++) {
    ans = min(ans, dp[k][i]);
  }
  cout << ans << '\n';
}
int main() {
  solve();
  return 0;
}
