#include<bits/stdc++.h>
#define CSP2026 using
#define RP namespace
#define PLUSPLUS std
CSP2026 RP PLUSPLUS;
#define debug(x) cout<<"clock="<<clock()<<' '<<#x<<'='<<(x)<<'\n'
//#define getchar getchar_unlocked
using ll=long long;
inline int rd(){int x=0,f=1;char ch=getchar();for(;!isdigit(ch);ch=getchar())if(ch=='-')f=-1;for(;isdigit(ch);ch=getchar())x=(x<<3)+(x<<1)+(ch^48);return x*f;}
inline ll rdll(){ll x=0;int f=1;char ch=getchar();for(;!isdigit(ch);ch=getchar())if(ch=='-')f=-1;for(;isdigit(ch);ch=getchar())x=(x<<3)+(x<<1)+(ch^48);return x*f;}
constexpr int N=3e5+5;
struct sgt{
	ll a[N<<2];
#define ls x<<1
#define rs x<<1|1
#define im int mid=(l+r)>>1
	void push_up(int x){a[x]=max(a[ls],a[rs]);}
	void update(int x,int l,int r,int k,int v){
		if(l==r)a[x]=v;
		else{
			im;
			if(k<=mid)update(ls,l,mid,k,v);
			else update(rs,mid+1,r,k,v);
			push_up(x);
		}
	}ll query(int x,int l,int r,int L,int R){
		if(L<=l&&r<=R)return a[x];
		else{
			im;
			ll ans=LLONG_MIN;
			if(L<=mid)ans=max(ans,query(ls,l,mid,L,R));
			if(R>mid)ans=max(ans,query(rs,mid+1,r,L,R));
			return ans;
		}
	}
}ds;
int a[N];
ll f[N],sum[N];
signed main(){
	int n=rd(),B=rd(),C=rd();
//	cout<<n<<' '<<B<<' '<<C<<'\n';
	ll ans=0;
	memset(ds.a,192,sizeof ds.a);
	f[0]=0;
	ds.update(1,0,n,0,0);
	for(int i=1;i<=n;++i){
		sum[i]=sum[i-1]+(a[i]=rd());
		f[i]=a[i];
		if(i>=2)f[i]=a[i]+f[i-2];
		if(i>=3&&B>=3)f[i]=a[i]+max(f[i-2],f[i-3]);
		if(C>=3)f[i]=max(f[i],sum[i]+ds.query(1,0,n,max(i-C+2,0),i-1));
//		cout<<i<<' '<<f[i]<<'\n';
		ans=max(ans,f[i]);
		if(i==1)ds.update(1,0,n,i,-sum[i-1]);
		if(B==2||i==2)ds.update(1,0,n,i,f[i-2]-sum[i-1]);
		else ds.update(1,0,n,i,max(f[i-2],f[i-3])-sum[i-1]);
//		cout<<i<<' '<<ds.query(1,0,n,i,i)<<'\n';
	}cout<<ans<<'\n';
}
/*
4 5 4
5 6 9 6 
*/