Bukazoids

A gluttonous robot lives on a strip of $n+1$ cells numbered from $0$ to $n$. The robot starts at cell $0$. Every cell other than cell $0$ contains some bukazoids, which the robot eats whenever it lands on that cell.

The robot moves only forward and makes exactly two kinds of jumps:

• a single jump moves it to the next cell (distance $1$);
• a double jump moves it over one cell (distance $2$).

It performs exactly $m$ single jumps and $k$ double jumps, and these counts satisfy $m + 2k = n$, so after all of its jumps the robot lands exactly on cell $n$. Along the way it collects the bukazoids of every cell it lands on.

Find the maximum total number of bukazoids the robot can collect.

The first line contains three integers $n$ ($1 \le n \le 100$), $m$ ($0 \le m \le 100$), and $k$ ($0 \le k \le 100$), satisfying $m + 2k = n$.

The second line contains $n$ integers: the number of bukazoids in cells $1, 2, \dots, n$ in order. Each value is an integer between $0$ and $100$.

On the first line, print the maximum total number of bukazoids.

On the second line, print the $m + k + 1$ cell numbers the robot visits, starting from cell $0$, that achieve this maximum. If several routes collect the maximum, print the lexicographically smallest such sequence of cell numbers (compare the two sequences position by position; the one with the smaller value at the first position where they differ is smaller).