#include <bits/stdc++.h>
using namespace std;
int n, kk, s;
int dp[151][151][151];
int main() {
  cin >> n >> kk >> s;
  int a[n + 1], sum = 0;
  a[0] = 0;
  for (int i = 1; i <= n; i++) cin >> a[i];
  for (int i = 1; i <= kk; i++) sum += a[i];
  s = min(s, n * (n + 1) / 2);
  int ans = 0;
  for (int i = 1; i <= s; i++) {
    for (int j = kk; j > 0; j--) {
      for (int k = kk + 1; k <= n; k++) {
        dp[i % (n + 1)][j][k] =
            min({dp[i % (n + 1)][j + 1][k - 1],
                 k - j > i ? 0
                           : dp[(i - k + j + n + 1) % (n + 1)][j + 1][k - 1] +
                                 a[k] - a[j],
                 dp[i % (n + 1)][j + 1][k], dp[i % (n + 1)][j][k - 1]});
        ans = min(ans, dp[i % (n + 1)][j][k]);
      }
    }
  }
  cout << sum + ans << endl;
  return 0;
}
