#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N=2e5+10;
int n,l,r;
int a[N];
ll ans;
string sans;
struct node{
	ll v;
	string s;
}f[N*2];
int main(){
	freopen("iceroad.in","r",stdin);
	freopen("iceroad.out","w",stdout);
	scanf("%d%d%d",&n,&l,&r);
	for(int i=0;i<=n;i++){
		scanf("%d",&a[i]);
		f[i].s=i+'0';
	}
	for(int i=l;i<=n+r-1;i++){
		for(int j=max(0,i-r);j<=i-l;j++){
			if(f[i].v<f[j].v){
				f[i].v=f[j].v;
				f[i].s+=f[j].s;
			}
		}
		f[i].v+=a[i];
	}
	for(int i=n+1;i<=n+l;i++){
		if(ans<f[i].v){
			ans=f[i].v;
			sans=f[i].s;
		}
	}
	printf("%lld\n",ans);
	sans="0"+sans;
	ll len=sans.size();
	for(int i=0;i<len;i++){
		cout<<sans[i]<<" ";
	}
	cout<<"-1";
	return 0;
}