Lizards and Basements 2
题目（https://acs.jxnu.edu.cn/problem/CF6D）描述：
This is simplified version of the problem used on the original contest. The original problem seems to have too difiicult solution. The constraints for input data have been reduced.
Polycarp likes to play computer role-playing game «Lizards and Basements». At the moment he is playing it as a magician. At one of the last levels he has to fight the line of archers. The only spell with which he can damage them is a fire ball. If Polycarp hits the i-th archer with his fire ball (they are numbered from left to right), the archer loses a health points. At the same time the spell damages the archers adjacent to the i-th (if any) — they lose b (1 ≤ b < a ≤ 10) health points each.
As the extreme archers (i.e. archers numbered 1 and n) are very far, the fire ball cannot reach them. Polycarp can hit any other archer with his fire ball.
The amount of health points for each archer is known. An archer will be killed when this amount is less than 0. What is the minimum amount of spells Polycarp can use to kill all the enemies?
Polycarp can throw his fire ball into an archer if the latter is already killed.
输入：
The first line of the input contains three integers n, a, b (3 ≤ n ≤ 10; 1 ≤ b < a ≤ 10). The second line contains a sequence of n integers — h1, h2, ..., hn (1 ≤ hi ≤ 15), where hi is the amount of health points the i-th archer has.
输出：
In the first line print t — the required minimum amount of fire balls.
In the second line print t numbers — indexes of the archers that Polycarp should hit to kill all the archers in t shots. All these numbers should be between 2 and n - 1. Separate numbers with spaces. If there are several solutions, output any of them. Print numbers in any order.
样例输入：
3 2 1
2 2 2
样例输出：
3
2 2 2
样例输入：
4 3 1
1 4 1 1
样例输出：
4
2 2 3 3
翻译：
这是原来的题目的简化版本。原来的题目似乎太难了。输入数据的限制减少了。
Polycarp喜欢玩电脑角色扮演游戏«Lizards and Basements»。他现在以魔术师的角色玩。在一个最后等级他需要和一排弓箭手战斗。他唯一的可以伤到他们的魔法攻击是火球。如果Polycarp用火球打中了第i个弓箭手（弓箭手从左到右编号），弓箭手会失去a点生命值。同时第i个弓箭手邻近的弓箭手（如果有的话），每个会失去b(1 ≤ b < a ≤ 10)点生命值。
每个弓箭手的生命值已知。弓箭手生命值少于等于0时死亡。Polycarp最少要用多少火球才能杀死所有弓箭手？
Polycarp可以扔火球给弓箭手如果他后一个弓箭手以0死亡。
输入：
第一行包含三个整数，n,a,b(3 ≤ n ≤ 10; 1 ≤ b < a ≤ 10)。第二行包含一个n个整数的序列h1, h2, ..., hn (1 ≤ hi ≤ 15)，表示第i个弓箭手的生命值。
输出：
第一行输出一个整数t，表示所需的最少的火球数。
第二行输出t个数字，表示Polycarp在t次反射要消灭的弓箭手数。所有的数字在2和n-1之间。数字间用单空格隔开。如果有多组解，输出任意一种。
样例输入：
3 2 1
2 2 2
样例输出：
3
2 2 2
样例输入：
4 3 1
1 4 1 1
样例输出：
4
2 2 3 3
