#include <bits/stdc++.h>
const int MAXN = 11;
using namespace std;
int hit[MAXN], n, a, b, h[MAXN], ans, fa[MAXN];
bool dfs(int l, int k, int last) {
  if (k == 0) {
    int flag = 0;
    for (int i = 1; i <= n; i++)
      if (h[i] >= 0) flag = 1;
    if (!flag)
      return 1;
    else
      return 0;
  }
  if (h[l] < 0) {
    return dfs(l + 1, k, last);
  }
  for (int i = min(n - 1, max(last, max(2, l))); i <= min(n - 1, l + 1); i++) {
    h[i] -= a;
    h[i - 1] -= b;
    h[i + 1] -= b;
    if (dfs(l, k - 1, i)) {
      fa[k] = i;
      return 1;
    }
    h[i] += a;
    h[i - 1] += b;
    h[i + 1] += b;
  }
  return 0;
}
int main() {
  scanf("%d %d %d", &n, &a, &b);
  for (int i = 1; i <= n; i++) scanf("%d", &h[i]);
  for (int i = 1;; i++) {
    memset(fa, 0, sizeof(fa));
    if (dfs(1, i, 2)) {
      printf("%d\n", i);
      for (int j = 1; j <= i; j++) {
        printf("%d ", fa[j]);
      }
      return 0;
    }
  }
}
