#include <bits/stdc++.h>
using namespace std;
int f[155][155 * 155], n, K, s, a[155];
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 k = 1; k <= n; k++)
    for (int i = k - 1; i >= 0; i--)
      for (int j = 0; j <= i * k; j++)
        f[i + 1][j + k - i - 1] = min(f[i + 1][j + k - i - 1], f[i][j] + a[k]);
  int ans = 0x3f3f3f3f;
  for (int i = 0; i <= min(n * n, s); i++) ans = min(ans, f[K][i]);
  printf("%d\n", ans);
}
