#include <bits/stdc++.h>
using namespace std;
int a, b, n, i, ans, arr[20], res[100];
bool dfs(int d, int x, int l) {
  if (d == 0) {
    for (int i = 1; i <= n; i++)
      if (arr[i] >= 0) return false;
    return true;
  }
  if (arr[x] < 0) return dfs(d, x + 1, l);
  if (x == n) {
    arr[n] -= b;
    res[d] = n - 1;
    if (dfs(d - 1, x, l)) return true;
    arr[n] += b;
  } else
    for (int i = l; i <= x + 1; i++)
      if ((1 < i) && (i < n)) {
        res[d] = i;
        arr[i] -= a;
        arr[i - 1] -= b;
        arr[i + 1] -= b;
        if (dfs(d - 1, x, i)) return true;
        arr[i] += a;
        arr[i - 1] += b;
        arr[i + 1] += b;
      }
  return false;
}
int main() {
  scanf("%d %d %d", &n, &a, &b);
  for (int i = 1; i <= n; i++) scanf("%d", &arr[i]);
  for (ans = 1;; ans++)
    if (dfs(ans, 1, 2)) {
      printf("%d\n", ans);
      for (int i = ans; i > 0; i--) printf("%d ", res[i]);
      return 0;
    }
}
