#include <bits/stdc++.h>
using namespace std;
int n, k, s, mx = 0, f[151][151 * 151], q[155];
int main() {
  scanf("%d %d %d", &n, &k, &s);
  for (int i = 0; i < n; i++) {
    scanf("%d", &q[i]);
  }
  for (int i = 0; i < k; i++) {
    s += i;
  }
  for (int i = 0; i < n; i++) {
    mx += i;
  }
  s = min(s, mx);
  for (int kk = 0; kk <= k; kk++) {
    for (int ss = 0; ss <= s; ss++) {
      if (kk == 0) {
        f[kk][ss] = 0;
      } else {
        f[kk][ss] = 1e9;
      }
    }
  }
  for (int i = 0; i < n; i++) {
    for (int kk = k; kk >= 1; kk--) {
      for (int ss = i; ss <= s; ss++) {
        f[kk][ss] = min(f[kk][ss], f[kk - 1][ss - i] + q[i]);
      }
    }
  }
  printf("%d\n", f[k][s]);
  return 0;
}
