#include <cstdio>
#include <queue>
#include <algorithm>
using namespace std;
int n, a, b;
priority_queue <int> q;
int main()
{
freopen("dry.in","r",stdin);
freopen("dry.out","w",stdout);
scanf("%d %d %d", &n, &a, &b);
for(int i = 1; i <= n; i++){
int k;
scanf("%d", &k);
q.push(k);
}
int time = 0, sum = 0;
while(q.top()-sum > 0){
int k = q.top();
q.pop();
k -= b;
q.push(k);
sum += a;
time++;
}
printf("%d", time);
}