#include <bits/stdc++.h>
using namespace std;
template <typename T>
using V = vector<T>;
int gcdex(int a, int b, int &x, int &y) {
  if (a == 0) {
    x = 0;
    y = 1;
    return b;
  }
  int x1, y1;
  int g = gcdex(b % a, a, x1, y1);
  x = y1 - (b / a) * x1;
  y = x1;
  return g;
}
inline int ADD_MOD(int a, int b) { return (a + b) % 1000000007; }
inline int MUL_MOD(int a, int b) { return (int64_t(a) * b) % 1000000007; }
inline int SUB_MOD(int a, int b) { return a >= b ? a - b : a + 1000000007 - b; }
int DIV_MOD(int a, int b) {
  int x, y;
  gcdex(b, 1000000007, x, y);
  int b1 = (x % 1000000007 + 1000000007) % 1000000007;
  return MUL_MOD(a, b1);
}
const long double EPS = 1. / 1e6;
inline bool EPS_EQUAL(long double a, long double b) {
  return abs(a - b) <= EPS;
}
inline bool EPS_LESS(long double a, long double b) { return b - a > EPS; }
inline bool EPS_GREATER(long double a, long double b) { return a - b > EPS; }
const int INF = 1e9;
int dp[2][150][150 * 150 / 2 + 1] = {0};
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.precision(15);
  int n, k, s;
  cin >> n >> k >> s;
  V<int> a(n);
  for (auto &i : a) {
    cin >> i;
  }
  int cur = 0;
  int next = 1;
  s = min(s + 1, n * n / 2 + 1);
  for (int i = 0; i < k; ++i) {
    for (int j = 0; j < s; ++j) {
      dp[next][i][j] = INF;
    }
    dp[next][i][0] = (i > 0 ? dp[cur][i - 1][0] + a[i] : a[i]);
    for (int j = i + 1; j < n; ++j) {
      int cost = j - i;
      for (int l = 0; l < s; ++l) {
        int prevSum = (l >= cost ? dp[cur][j - 1][l - cost] + a[j] : INF);
        dp[next][j][l] = min(dp[next][j - 1][l], prevSum);
      }
    }
    swap(cur, next);
  }
  int minSum = INF;
  for (int i = k - 1; i < n; ++i) {
    for (int j = 0; j < s; ++j) {
      minSum = min(minSum, dp[cur][i][j]);
    }
  }
  cout << minSum << endl;
  return 0;
}
