#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 200000 + 10, INF = 0x7fffffff;
int n, l, r, k, a[N], f[N], p[N];
bool v[N];
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);
    for(int i=1; i<=n; i++) {
        f[i] = -INF; k = -1;
        for(int j=i-l; j>=i-r && j>=0; j--)
            if(f[j] > -INF && (k < 0 || f[j] > f[k])) k = j;
        if(k >= 0) f[i] = a[i] + f[k], p[i] = k;
    }
    k = -1;
    for(int i=n-r+1; i<=n; i++)
        if(k < 0 || f[i] > f[k]) k = i;
    printf("%d\n", f[k]);
    while(k) {
        v[k] = 1;
        k = p[k];
    } v[0] = 1;
    for(int i=0; i<=n; i++)
        if(v[i]) printf("%d ", i);
    printf("%d\n", -1);
    return 0;
}