#include <bits/stdc++.h>
using namespace std;
const long long N = 2e5 + 30, Mod = 1e9 + 7;
const long long SQ = 200;
long long a[N];
long long dp[SQ][SQ * SQ];
int main() {
  ios::sync_with_stdio(0), cin.tie(0);
  long long n, k, s;
  cin >> n >> k >> s;
  for (int i = 0; i < n; i++) cin >> a[i];
  memset(dp, 63, sizeof(dp));
  dp[0][0] = 0;
  s = min(s, SQ * SQ - 6);
  for (int i = 0; i < n; i++)
    for (int j = k; j > 0; j--)
      for (int p = i - j + 1; p <= s; p++)
        dp[j][p] = min(dp[j][p], dp[j - 1][p - (i - j + 1)] + a[i]);
  cout << *min_element(dp[k], dp[k] + s + 1);
  return (0);
}
