#include <bits/stdc++.h>
using namespace std;
char _;
const int maxN = 150 + 5;
const int mod = 1000 * 1000 * 1000 + 7;
const int SQ = 317;
const int maxL = 302;
int a[maxN];
long long L[80][15000];
long long R[80][15000];
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int n, k, s;
  cin >> n >> k >> s;
  for (int i = 0; i < n; i++) cin >> a[i];
  if (s >= 15000) {
    sort(a, a + n);
    int ans = 0;
    for (int i = 0; i < k; i++) ans += a[i];
    cout << ans << endl;
    return 0;
  }
  int ted = min(k, n - k);
  for (int i = 0; i < 80; i++)
    for (int j = 0; j < 15000; j++) L[i][j] = -mod, R[i][j] = mod;
  for (int i = 0; i < 15000; i++) L[0][i] = R[0][i] = 0;
  for (int i = 0; i < k; i++) {
    int dis = k - i;
    for (int j = ted; j > 0; j--)
      for (int t = dis; t < s + 1; t++)
        L[j][t] = max(L[j][t], L[j - 1][t - dis] + a[i]);
  }
  for (int i = k; i < n; i++) {
    int dis = i - k;
    for (int j = ted; j > 0; j--)
      for (int t = dis; t < s + 1; t++)
        R[j][t] = min(R[j][t], R[j - 1][t - dis] + a[i]);
  }
  long long ans = 0, tmp = 0;
  for (int i = 0; i < k; i++) ans += a[i], tmp += a[i];
  for (int i = 1; i < ted + 1; i++) {
    for (int j = 0; j < s + 1; j++) {
      long long xx = R[i][s - j] - L[i][j];
      ans = min(ans, tmp + xx);
    }
  }
  cout << ans << endl;
  return 0;
}
