#include <bits/stdc++.h>
using namespace std;
const int inf = 1e9;
int d[200][155][155];
int c[150 + 1];
int main() {
  int n, k, s;
  scanf(" %d %d %d", &n, &k, &s);
  for (int i = 1; i <= n; i++) {
    scanf(" %d", &c[i]);
  }
  int sum = 0;
  for (int i = 1; i <= k; i++) {
    sum += c[i];
  }
  s = min((n * (n + 1)) / 2, s);
  int ans = 1000000000;
  int id[n];
  id[0] = 0;
  for (int i = 1; i <= n; i++) {
    id[i] = 200 - i;
  }
  for (int i = 1; i <= s; i++) {
    int ii = i % 200;
    for (int j = 1; j <= n; j++) {
      id[j]++;
      if (id[j] == 200) id[j] -= 200;
    }
    for (int x = k; x > 0; x--) {
      for (int y = k + 1; y < n + 1; y++) {
        d[ii][x][y] =
            min({(i < (y - x) ? inf : d[id[y - x]][x + 1][y - 1] + c[y] - c[x]),
                 d[ii][x + 1][y - 1], d[ii][x][y - 1], d[ii][x + 1][y]});
        ans = min(ans, d[ii][x][y]);
      }
    }
  }
  printf("%d\n", sum + (ans >= 0 ? 0 : ans));
  return 0;
}
