#include <bits/stdc++.h>
using namespace std;
const int MAXN = 155;
const int INF = 0x3f3f3f3f;
int dp[2][MAXN][10001];
int a[MAXN];
int b[MAXN];
int n, k, s;
void solve() {
  int sum = 0;
  if (s > 10000) s = 10000;
  n -= k;
  for (int i = k; i >= 1; --i) {
    scanf("%d", &a[i]);
    sum += a[i];
  }
  for (int i = 1; i <= n; ++i) {
    scanf("%d", &b[i]);
  }
  int cur = 0;
  memset(dp[cur], 0, sizeof dp[cur]);
  for (int i = 1; i <= k; ++i) {
    cur ^= 1;
    memset(dp[cur], 0, sizeof dp[cur]);
    for (int j = 1; j <= n; ++j) {
      for (int l = 0; l <= s; ++l) {
        dp[cur][j][l] = min(dp[cur][j - 1][l], dp[cur ^ 1][j][l]);
        if (l >= i + j - 1)
          dp[cur][j][l] = min(
              dp[cur][j][l], dp[cur ^ 1][j - 1][l - (i + j - 1)] + b[j] - a[i]);
      }
    }
  }
  int ans = sum;
  for (int i = 0; i <= s; ++i) {
    ans = min(ans, sum + dp[cur][n][i]);
  }
  printf("%d\n", ans);
}
int main() {
  while (~scanf("%d%d%d", &n, &k, &s)) solve();
  return 0;
}
