#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int n = 0, k = 0, s = 0;
  cin >> n >> k >> s;
  int sz = min(n * (n - 1), k * (k - 1) / 2 + s);
  vector<vector<int> > dp(k + 1, vector<int>(sz + 1, 1e9 + 42));
  dp[0][0] = 0;
  for (int pos = 0; pos < n; pos++) {
    int q;
    cin >> q;
    for (int i = k - 1; i >= 0; i--)
      for (int j = sz - pos; j >= 0; j--)
        dp[i + 1][j + pos] = min(dp[i + 1][j + pos], dp[i][j] + q);
  }
  int ans = 1e9 + 42;
  for (int i = k * (k - 1) / 2; i <= sz; i++) ans = min(ans, dp[k][i]);
  cout << ans;
  return 0;
}
