#include<iostream>
#include<fstream>
#include<algorithm>
	int n,a,b,c,biao,maxx=0;
	int l[500001]={0};
using namespace std;
	ifstream fin("dry.in");
	ofstream fout("dry.out");
int main()
{
	fin>>n>>a>>b;
	for (int i=1;i<=n;i++)
	{
		fin>>a;
		l[a]++;
		if (a>maxx) maxx=a;
	}
	biao=0;
	for (int i=maxx;i>=1;i--)
	{
		while (l[i]>0)
		{
			if (i<=biao)
			{
				fout<<biao/a;
				return 0;
			}
			l[i]--;
			if ((i-b)>biao)
				l[i-b]++;
			biao=biao+a;
		}
	}
	fin.close();
	fout.close();
	return 0;
}