#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, b, c;
  cin >> n >> b >> c;
  b--, c--;
  swap(b, c);
  VI a(n);
  rep(i, n) cin >> a[i];
  VL s(n + 1);
  rep(i, n) s[i+1] = s[i] + a[i];
  constexpr long long INF = 1002003004005006007;
  segtree<ll, [](ll x, ll y) { return max(x, y); }, []() { return -INF; }> dp0(n + 1), dp1(n + 1);
  dp0.set(0, 0);
  dp1.set(0, 0);
  for (int i = 1; i <= n; i++) {
    dp1.set(i, dp0.prod(max(i-b, 0), i) + s[i]);
    dp0.set(i, dp1.prod(max(i-c, 0), i) - s[i]);
  }
  ll ans = max(dp0.get(n) + s[n], dp1.get(n));
  cout << ans << '\n';
}