#include <iostream>
#include <cstdio>
#include <fstream>
#include <cstring>
using namespace std;

const int MAXN = 2e5 + 10;

int n, L, R;
int a[MAXN];
int ans;
int path[MAXN], anspath[MAXN];

void dfs(int step, int now, int w) {
	if (now > n) {
		if (w > ans) {
			ans = w;
			memcpy(anspath, path, step * sizeof(int));
			anspath[step] = -1;
		}
		return ;
	}
	path[step] = now;
	dfs(step + 1, now + L, w + a[now + L]);
	dfs(step + 1, now + R, w + a[now + R]);
	return ;
}

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]);
	}
	
	dfs(0, 0, 0);
	
	printf("%d\n0 ", ans);;
	for (int i = 1; ; ++i) {
		printf("%d ", anspath[i]);
		if (anspath[i] == -1) break;
	}
	return 0;
}