#include <bits/stdc++.h>
#pragma GCC optimize("-O3")
using namespace std;
const double PI = acos(-1);
long long gcd() { return 0ll; }
template <typename T, typename... Args>
T gcd(T a, Args... args) {
  return __gcd(a, (__typeof(a))gcd(args...));
}
vector<int> ans;
int h[17];
int dp[17][17][17], ht[17][17][17], at[17][17][17];
int n, a, b;
int solve(int i, int j, int k) {
  if (i == n - 1) {
    return j > 0 ? INT_MAX : 0;
  }
  int &res = dp[i][j][k];
  if (res != -1) return res;
  res = INT_MAX;
  int x = h[i] - k * b, p;
  x = max(0, x);
  for (__typeof(17) t = (0) - ((0) > (17)); t != (17) - ((0) > (17));
       t += 1 - 2 * ((0) > (17))) {
    if ((j - t * b) > 0) continue;
    p = solve(i + 1, max(0, x - t * a), t) + t;
    if (p < res) {
      res = p;
      ht[i][j][k] = max(0, x - t * a);
      at[i][j][k] = t;
    }
  }
  return res;
}
void path(int i, int j, int k) {
  if (i == n - 1) return;
  for (__typeof(at[i][j][k]) t = (0) - ((0) > (at[i][j][k]));
       t != (at[i][j][k]) - ((0) > (at[i][j][k]));
       t += 1 - 2 * ((0) > (at[i][j][k])))
    ans.emplace_back(i);
  path(i + 1, ht[i][j][k], at[i][j][k]);
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  {
    memset(dp, -1, sizeof(dp));
    cin >> n >> a >> b;
    for (__typeof(n) i = (0) - ((0) > (n)); i != (n) - ((0) > (n));
         i += 1 - 2 * ((0) > (n)))
      cin >> h[i], h[i]++;
    while (h[0] > 0) {
      h[0] -= b;
      h[1] -= a;
      h[2] -= b;
      ans.emplace_back(1);
    }
    h[0] = max(0, h[0]);
    h[1] = max(0, h[1]);
    h[2] = max(0, h[2]);
    while (h[n - 1] > 0) {
      h[n - 1] -= b;
      h[n - 2] -= a;
      h[n - 3] -= b;
      ans.emplace_back(n - 2);
    }
    h[n - 1] = max(0, h[n - 1]);
    h[n - 2] = max(0, h[n - 2]);
    h[n - 3] = max(0, h[n - 3]);
    solve(1, 0, 0);
    path(1, 0, 0);
    cout << ans.size() << "\n";
    for (auto it : ans) cout << it + 1 << " ";
  }
  return 0;
}
