#include <bits/stdc++.h>
#include <atcoder/segtree>

using namespace std;

using ll = long long;
constexpr ll inf = (1ll << 61) - 1;

ll op(ll a, ll b) {
  return min(a, b);
}

ll e() {
  return inf;
}

int main() {
  int N, B, C;
  cin >> N >> B >> C;
  vector< int > A(N);
  ll all = 0;
  for (auto& a : A) {
    cin >> a;
    all += a;
  }
  atcoder::segtree<ll, op, e> seg(N + 1);
  seg.set(0, 0);
  for (int i = 1; i <= N; i++) {
    seg.set(i,  seg.prod(max(0, i - C), i - (B == 2 and i >= 2)) + A[i - 1]);
  }
  cout << all - seg.prod(max(0, N + 1 - C), N + 1) << endl;
}