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