#include <bits/stdc++.h>
using namespace std;
int n, a, b, f[20] = {0}, SUM = 454345;
vector<int> U;
vector<int> H;
void rec(vector<int> V, int X) {
  int URT = V.size();
  if (URT >= SUM) return;
  bool T = 0;
  for (int i = 2; i < n; i++) {
    if (f[i] >= 0) {
      T = 1;
      break;
    }
  }
  if (T == 0) {
    if (URT < SUM) {
      SUM = URT;
      H = V;
    }
    return;
  }
  for (int i = X; i < n; i++) {
    if (f[i] >= 0 || f[i - 1] >= 0 || f[i + 1] >= 0) {
      f[i] -= a;
      f[i + 1] -= b;
      f[i - 1] -= b;
      V.push_back(i);
      rec(V, i);
      V.erase(V.begin() + URT);
      f[i] += a;
      f[i + 1] += b;
      f[i - 1] += b;
    }
  }
}
int main() {
  scanf("%d %d %d", &n, &a, &b);
  for (int i = 1; i <= n; i++) scanf("%d", &f[i]);
  while (f[1] >= 0) {
    f[3] -= b;
    f[2] -= a;
    f[1] -= b;
    U.push_back(2);
  }
  while (f[n] >= 0) {
    f[n] -= b;
    f[n - 1] -= a;
    f[n - 2] -= b;
    U.push_back(n - 1);
  }
  rec(H, 2);
  printf("%d\n", H.size() + U.size());
  for (int i = 0; i < U.size(); i++) printf("%d ", U[i]);
  for (int i = 0; i < H.size(); i++) printf("%d ", H[i]);
  return 0;
}
