/*
C++ Code
http://oijzh.cnblogs.com
By jiangzh
*/
#include<cstdio>
#include<queue>
using namespace std;
#define MAXN 500010
 
int n,a,b,wet[MAXN];
priority_queue<int> q;
int num=0,ans=0;
 
void init()
{
    freopen("dry.in","r",stdin);
    freopen("dry.out","w",stdout);
    scanf("%d%d%d",&n,&a,&b);
    for(int i=1;i<=n;i++) {scanf("%d",&wet[i]);q.push(wet[i]);}
}
 
void work()
{
    int sum=0;
    while(1)
    {
        if(sum>=q.top()) {printf("%d",ans);return;}
        sum+=a;
        int x=q.top();q.pop();
        x-=b;
        q.push(x);
        ans++;
    }
}
 
int main()
{
    init();
    work();
    return 0;
}