#include <bits/stdc++.h>
const int MAXN = 205, INF = 0x3f3f3f3f;
inline int min(int a, int b) { return a < b ? a : b; }
int dp[MAXN][MAXN * MAXN];
int read() {
  int x = 0, f = 1;
  char ch = getchar();
  while (ch < '9' || ch > '0') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = x * 10 + ch - '0';
    ch = getchar();
  }
  return f * x;
}
int main() {
  int n, m, k, x;
  scanf("%d%d%d", &n, &m, &k);
  memset(dp, INF, sizeof(dp));
  dp[0][0] = 0;
  for (int i = 1; i <= n; i++) {
    scanf("%d", &x);
    for (int j = i - 1; j >= 0; j--)
      for (int k = 0; k <= i * j; k++)
        if (dp[j][k] != INF)
          dp[j + 1][k + i - j - 1] =
              min(dp[j + 1][k + i - j - 1], dp[j][k] + x);
  }
  int ans = INF;
  for (int i = 0; i <= min(k, n * n); i++) ans = min(ans, dp[m][i]);
  printf("%d\n", ans);
  return 0;
}
