#include <fstream>
#include <cstdlib>
#include <cstdio>
using namespace std;
int comp(const void *i1, const void *i2) 
{
	return *(int*)i2-*(int*)i1;
}
 
int main()
{
	ifstream in("dry.in");
	ofstream out("dry.out");
	int cloth[10];
	int a=0, b=0, n=0;
	in>>n>>a>>b;
	for(int i = 0; i < n; i++)
	   in>>cloth[i];
	int time = 0;
	qsort(cloth, n, sizeof(int), comp);
	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), comp);
	}
	out<<time<<endl;
}