#include<bits/stdc++.h>
using namespace std ;

int n , a , b , l = 1 , r = 500005 ;
int x[ 500005 ] , y[ 500005 ] ;
bool check( int sum )
{
    int cnt = 0 ;
    memset( y , 0 , sizeof( y ) ) ;
    for ( int i = 1 ; i <= n ; i ++ )
    {
    	y[i] = a * sum ;
	}
	for ( int i = 1 ; i <= n ; i ++ )
	{
		int res = 0 ;
		while( y[i] < x[i] )
		{
			y[i] += b ;
			res ++ ;
		}
		cnt += res ;
	}
	return cnt <= sum ;
}
int main()
{
	
	cin >> n >> a >> b ;
	for ( int i = 1 ; i <= n ; i ++ ) cin >> x[i] ;
	
	while ( l < r )
	{
		int mid = ( l + r ) / 2 ;
		if ( check( mid ) ) 
		{
			r = mid ;
		}
		else l = mid + 1 ;
	}
	cout << r ;
	return 0 ;
}