#include <bits/stdc++.h>
using namespace std;
const int N = 200 + 10;
int anum = 1000000000;
int cnt;
int n;
int da;
int db;
int a[N];
int ans[N];
int fang[N];
void ri() {
  int i;
  cin >> n >> da >> db;
  for (i = 0; i < n; i++) cin >> a[i];
  for (i = 0; i < n; i++) a[i]++;
}
bool ok() {
  int i;
  for (i = 0; i < n; i++)
    if (a[i] > 0) return false;
  return true;
}
void search(int deep) {
  int i;
  if (deep == n - 1) {
    if (ok()) {
      if (cnt < anum) {
        anum = cnt;
        for (i = 0; i < cnt; i++) ans[i] = fang[i];
      }
    }
    return;
  }
  if (cnt > anum) return;
  if (a[deep - 1] <= 0) search(deep + 1);
  if (a[deep - 1] > 0 || a[deep] > 0 || a[deep + 1] > 0) {
    a[deep - 1] -= db;
    a[deep] -= da;
    a[deep + 1] -= db;
    fang[cnt++] = deep;
    search(deep);
    cnt--;
    a[deep - 1] += db;
    a[deep] += da;
    a[deep + 1] += db;
  }
}
void print() {
  int i;
  cout << anum << "\n";
  for (i = 0; i < anum; i++) cout << ans[i] + 1 << " ";
  cout << "\n";
}
int main() {
  ri();
  search(1);
  print();
  return 0;
}
