#include<iostream>
#include<fstream>
using namespace std;
int cmp(const void *a, const void *b)
{
	return *(int*)a-*(int*)b;
}
int main()
{
	ifstream fin("dry.in");
	ofstream fout("dry.out");
	int cloth[10];
	int a=0,b=0,n=0;
	fin>>n>>a>>b;
	for(int i=0;i<n;i++)
	{
		fin>>cloth[i];
	}
	int time=0;
	qsort(cloth,n,sizeof(int),cmp);
	while(cloth[0]!=0)
	{
		for(int i=0;i<n;i++)
		{
			if(i==0)
			{
				if(cloth[i]>=a+b) cloth[i]-=(a+b);
				else cloth[i]=0;
			}
			else if(cloth[i]>=a) cloth[i]-=a;
			else cloth[i]=0;
		}
		time++;
		qsort(cloth,n,sizeof(int),cmp);
	}
	fout<<time<<endl;
}