#include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll ILL=2167167167167167167;
const int INF=2100000000;
#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)
#define all(p) p.begin(),p.end()
template<class T> using pq_ = priority_queue<T, vector<T>, greater<T>>;
template<class T> int LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> int UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,T b){if(b<a){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,T b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
bool yneos(bool a,bool upp=false){if(a){cout<<(upp?"YES\n":"Yes\n");}else{cout<<(upp?"NO\n":"No\n");}return a;}
template<class T> void vec_out(vector<T> &p,int ty=0){
    if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<",";}cout<<'"'<<p[i]<<'"';}cout<<"}\n";}
    else{if(ty==1){cout<<p.size()<<"\n";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}}
template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}
template<class T> T vec_sum(vector<T> &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;}
int pop_count(long long a){int res=0;while(a){res+=(int)(a&1),a>>=1;}return res;}
template<class T> T square(T a){return a * a;}

#include <atcoder/segtree>
ll op(ll a, ll b) {
    return max(a, b);
}

ll e() {
    return -ILL;
}

void solve();
// DEAR MYSTERIES / TOMOO
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    // cin >> t;
    rep(i, 0, t) solve();
}

void solve(){
    int N, B, C;
    cin >> N >> B >> C;
    vector<ll> A(N), S(N + 1);
    rep(i, 0, N) cin >> A[i], S[i + 1] = S[i] + A[i];
    // i 日目に入る前まで働いていた
    atcoder::segtree<ll, op, e> segWork(N + 1);
    // i 日目に入る前まで
    atcoder::segtree<ll, op, e> segRest(N + 1);
    C--, B--;
    segRest.set(0, 0);
    segWork.set(0, 0);
    rep(i, 1, N + 1) {
        auto tmp = segRest.prod(max(i - C, 0), i);
        segWork.set(i, tmp + S[i]);
        // cout << tmp + S[i] << " ";
        tmp = segWork.prod(max(i - B, 0), i);
        segRest.set(i, tmp - S[i]);
        // cout << tmp << "\n";
    }
    cout << max(segRest.get(N) + S[N], segWork.all_prod()) << "\n";
}

/*
 * 3 日以上休むのはない
 *
 */