#include <bits/stdc++.h>
using namespace std;
const int N = 155;
int n, k, s, arr[N], dp[2][N * N][N];
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> k >> s;
  for (int i = 0; i < n; ++i) cin >> arr[i];
  s = min((n * (n - 1)) / 2, s);
  for (int idx = n; idx >= 0; --idx) {
    for (int swaps = 0; swaps <= s; ++swaps) {
      for (int rem = k; rem >= 0; --rem) {
        int &ret = dp[idx & 1][swaps][rem];
        if (idx == n)
          ret = (rem == k ? 0 : 1e9);
        else {
          ret = dp[(idx + 1) & 1][swaps][rem];
          if (swaps >= idx - rem && rem < k)
            ret = min(ret, dp[(idx + 1) & 1][swaps - (idx - rem)][rem + 1] +
                               arr[idx]);
        }
      }
    }
  }
  cout << dp[0][s][0];
  return 0;
}
