#include <bits/stdc++.h>
#pragma GCC optimize("Ofast", "unroll-loops", "omit-frame-pointer", "inline")
#pragma GCC option("arch=native", "tune=native", "no-zero-upper")
#pragma GCC target("avx2")
using namespace std;
template <typename T>
void maxtt(T& t1, T t2) {
  t1 = max(t1, t2);
}
template <typename T>
void mintt(T& t1, T t2) {
  t1 = min(t1, t2);
}
bool debug = 0;
int n, m, k;
int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0};
string direc = "RDLU";
const long long MOD2 = (long long)1000000007 * (long long)1000000007;
long long ln, lk, lm;
void etp(bool f = 0) {
  puts(f ? "YES" : "NO");
  exit(0);
}
void addmod(int& x, int y, int mod = 1000000007) {
  x += y;
  if (x >= mod) x -= mod;
  if (x < 0) x += mod;
  assert(x >= 0 && x < mod);
}
void et(int x = -1) {
  printf("%d\n", x);
  exit(0);
}
long long fastPow(long long x, long long y, int mod = 1000000007) {
  long long ans = 1;
  while (y > 0) {
    if (y & 1) ans = (x * ans) % mod;
    x = x * x % mod;
    y >>= 1;
  }
  return ans;
}
long long gcd1(long long x, long long y) { return y ? gcd1(y, x % y) : x; }
int h[22], dp[12][20][20];
pair<int, int> pre[12][20][20];
void fmain(int tid) {
  int n, a, b;
  cin >> n >> a >> b;
  for (int(i) = 1; (i) <= (int)(n); (i)++) cin >> h[i];
  for (int(i) = 1; (i) <= (int)(n); (i)++) h[i]++;
  for (int(i) = 0; (i) < (int)(12); (i)++)
    for (int(j) = 0; (j) < (int)(20); (j)++)
      for (int(k) = 0; (k) < (int)(20); (k)++) {
        dp[i][j][k] = (1 << 30);
      }
  dp[1][h[1]][0] = 0;
  for (int i = 2; i < n; i++) {
    for (int j = 0; j <= h[i - 1]; j++) {
      for (int(k) = 0; (k) < (int)(20); (k)++)
        if (dp[i - 1][j][k] < (1 << 30)) {
          for (int(x) = 0; (x) < (int)(20); (x)++) {
            if (j - b * x > 0) continue;
            int nj = max(h[i] - b * k - a * x, 0);
            if (dp[i][nj][x] > dp[i - 1][j][k] + x) {
              dp[i][nj][x] = dp[i - 1][j][k] + x;
              pre[i][nj][x] = {j, k};
            }
          }
        }
    }
  }
  int ans = (1 << 30);
  for (int(x) = 0; (x) < (int)(20); (x)++)
    if (b * x >= h[n]) {
      mintt(ans, dp[n - 1][0][x]);
    }
  printf("%d\n", ans);
  for (int(x) = 0; (x) < (int)(20); (x)++)
    if (b * x >= h[n]) {
      if (ans == dp[n - 1][0][x]) {
        for (int pos = n - 1, cnt = x, H = 0; pos > 1; pos--) {
          for (int(tt) = 0; (tt) < (int)(cnt); (tt)++) printf("%d ", pos);
          auto pr = pre[pos][H][cnt];
          cnt = pr.second;
          H = pr.first;
        }
        return;
      }
    }
}
int main() {
  int t = 1;
  for (int(i) = 1; (i) <= (int)(t); (i)++) {
    fmain(i);
  }
  return 0;
}
