#include<bits/stdc++.h>
#define il inline
#define re register
#define ll long long
using namespace std;
#define MAXN 15
int n,A,B,a[MAXN],ans=1e9;
int b[MAXN],c[MAXN];
void DFS(int x,int sum){
	if(sum>=ans)return;
	if(x==n){if(a[n]<0){for(re int i=1;i<=n;++i)b[i]=c[i];ans=sum;}return;}
	for(re int i=0;i*B-B<=a[x-1]||i*A-A<=a[x]||i*B-B<=a[x+1];++i){
		a[x-1]-=i*B,a[x]-=i*A,a[x+1]-=i*B;
		if(a[x-1]<0)c[x]=i,DFS(x+1,sum+i);
		a[x-1]+=i*B,a[x]+=i*A,a[x+1]+=i*B;
	}
}
int main(){
	scanf("%d%d%d",&n,&A,&B);for(re int i=1;i<=n;++i)scanf("%d",&a[i]);
	DFS(2,0),printf("%d\n",ans);for(re int i=1;i<=n;++i)for(re int j=0;j<b[i];++j)printf("%d ",i);
}