#include <bits/stdc++.h>
using namespace std;
const int maxn = 155;
int n, k, s;
int f[maxn][40010];
int a[maxn];
int main() {
  scanf("%d%d%d", &n, &k, &s);
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
  memset(f, 0x3f, sizeof(f));
  f[0][0] = 0;
  for (int l = 1; l <= n; l++)
    for (int i = l - 1; i >= 0; i--)
      for (int j = 0; j <= l * i; j++)
        f[i + 1][j + l - i - 1] = min(f[i + 1][j + l - i - 1], f[i][j] + a[l]);
  int ans = 1e9;
  for (int i = 0; i <= min(s, n * n); i++) ans = min(ans, f[k][i]);
  printf("%d", ans);
  return 0;
}
