#include <bits/stdc++.h>
using namespace std;
int n, k, s;
int q[155];
int dp[155][155 * 155 / 2], tmp[155][155 * 155 / 2];
int main() {
  ios::sync_with_stdio(0);
  cin >> n >> k >> s;
  for (int i = 1; i <= n; i++) {
    cin >> q[i];
  }
  s = min(s, n * (n - 1) / 2);
  for (int i = 1; i <= k; i++) {
    memcpy(tmp, dp, sizeof(dp));
    memset(dp, 0x7f7f7f7f, sizeof(dp));
    for (int ss = s; ss >= 0; ss--) {
      for (int j = k + 1; j <= n + 1; j++) {
        dp[j][ss] = min(dp[j][ss], tmp[j][ss] + q[i]);
      }
    }
    for (int j = k + 1; j <= n; j++) {
      int num = k - i + j - k;
      for (int ss = s; ss >= num; ss--) {
        dp[j + 1][ss - num] = min(dp[j + 1][ss - num], tmp[j][ss] + q[j]);
      }
    }
    for (int ss = s; ss >= 0; ss--) {
      for (int j = k + 1; j <= n + 1; j++) {
        dp[j][ss] = min(dp[j][ss], dp[j - 1][ss]);
      }
    }
  }
  cout << dp[n + 1][0] << '\n';
}
