#include<bits/stdc++.h>
#include<atcoder/segtree.hpp>
using namespace std;

using ll=long long;
ll inf=1e18;
ll op(ll a,ll b){return max(a,b);}
ll e(){return -inf;}

int main(){
  int n,b,c;
  cin>>n>>b>>c;
  vector<int> a(n);
  vector<ll> sum(n+1);
  for (int i=0;i<n;i++) cin>>a[i],sum[i+1]=sum[i]+a[i];
  atcoder::segtree<ll,op,e> seg1(n+1),seg2(n+1);
  seg1.set(0,0);
  for (int i=1;i<=n;i++){
    ll p1=seg2.prod(max(0,i-b+1),i);
    ll p2=seg1.prod(max(0,i-c+1),i);
    if (i<b) p1=max(p1,0LL);
    seg1.set(i,p1-sum[i]);
    seg2.set(i,p2+sum[i]);
  }
  ll ans=max(seg1.get(n)+sum[n],seg2.get(n));
  cout<<ans<<endl;
}