/* -*- coding: utf-8 -*-
 *
 * 3760.cc:  No.3760 Streaming Schedule - yukicoder
 */

#include<cstdio>
#include<vector>
#include<algorithm>

using namespace std;

/* constant */

const int MAX_N = 300000;
const long long LINF = 1LL << 60;

/* typedef */

using ll = long long;

template <typename T>
struct SegTreeMax {
  int e2;
  vector<T> nodes;
  T defv;
  SegTreeMax() {}

  void init(int n, T _defv) {
    defv = _defv;
    for (e2 = 1; e2 < n; e2 <<= 1);
    nodes.assign(e2 * 2, defv);
  }

  T &geti(int i) { return nodes[e2 - 1 + i]; }
  void seti(int i, T v) { geti(i) = v; }

  void setall() {
    for (int j = e2 - 2; j >= 0; j--)
      nodes[j] = max(nodes[j * 2 + 1], nodes[j * 2 + 2]);
  }

  void set(int i, T v) {
    int j = e2 - 1 + i;
    nodes[j] = v;
    while (j > 0) {
      j = (j - 1) / 2;
      nodes[j] = max(nodes[j * 2 + 1], nodes[j * 2 + 2]);
    }
  }

  T max_range(int r0, int r1, int k, int i0, int i1) {
    if (r1 <= i0 || i1 <= r0) return defv;
    if (r0 <= i0 && i1 <= r1) return nodes[k];

    int im = (i0 + i1) / 2;
    T v0 = max_range(r0, r1, k * 2 + 1, i0, im);
    T v1 = max_range(r0, r1, k * 2 + 2, im, i1);
    return max(v0, v1);
  }
  T max_range(int r0, int r1) { return max_range(r0, r1, 0, 0, e2); }
};

/* global variables */

int as[MAX_N];
ll ass[MAX_N + 1], dp0[MAX_N + 1], dp1[MAX_N + 1];
SegTreeMax<ll> st0, st1;

/* subroutines */

/* main */

int main() {
  int n, b, c;
  scanf("%d%d%d", &n, &b, &c);
  for (int i = 0; i < n; i++) scanf("%d", as + i);

  for (int i = 0; i < n; i++) ass[i + 1] = ass[i] + as[i];
  
  st0.init(n + 1, -LINF);
  st0.set(0, 0);
  st1.init(n + 1, -LINF);
  st1.set(0, 0);

  for (int i = 1; i <= n; i++) {
    dp0[i] = st1.max_range(i - b + 1, i);
    dp1[i] = st0.max_range(i - c + 1, i) + ass[i];
    st0.set(i, dp0[i] - ass[i]);
    st1.set(i, dp1[i]);
  }

  printf("%lld\n", max(dp0[n], dp1[n]));
  
  return 0;
}