#include <cstdio>
#include <cstdlib>
#include <set>
#include <algorithm>
using namespace std;
multiset<int> hash;
int N,A,B,x,ans=0;
int main()
{
	freopen("dry.in","r",stdin);
	freopen("dry.out","w",stdout);
	scanf("%d %d %d\n",&N,&A,&B);
	for(int i=1;i<=N;i++)
	{
		scanf("%d\n",&x); hash.insert(x);
	}
	multiset<int> :: iterator iter;
	while(hash.size())
	{
		iter=hash.end(); iter--; x=*iter;
		if(x<=ans*A) break; ans++;
		x-=B; hash.erase(iter); 
		if(x>0) hash.insert(x);
	}
	printf("%d\n",ans);
	return 0;
}