#include <bits/stdc++.h>
using namespace std;
int main() {
  ios_base ::sync_with_stdio(0);
  int n, k, s;
  cin >> n >> k >> s;
  int a[n + 2], b[n + 2];
  b[0] = 0;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
    b[i] = a[i] + b[i - 1];
  }
  vector<vector<vector<int> > > ff;
  ff.resize(k + 2);
  for (int i = 0; i <= k; i++) {
    ff[i].resize(n - k + 2);
    for (int j = 0; j < n - k + 2; j++) {
      ff[i][j].resize((k + 2) * (n - k + 2), -1);
    }
  }
  function<int(int, int, int)> dfs = [&](int l, int r, int cnt) {
    if (l < 1) return 0;
    if (r > n) return b[l];
    int& ret = ff[l][r - k][cnt];
    if (~ret) return ret;
    ret = INT_MAX;
    if (cnt + r - l <= s) {
      ret = min(ret, a[r] + dfs(l - 1, r + 1, cnt + r - l));
    }
    ret = min(ret, min(a[l] + dfs(l - 1, r, cnt), dfs(l, r + 1, cnt)));
    return ret;
  };
  cout << dfs(k, k + 1, 0) << "\n";
  return 0;
}
