#include<bits/stdc++.h>
using namespace std;
const int N = 500000 + 500;
int n, a, b;
int p[N];
int t = 0;
bool cmp(int a, int b)
{
return a > b;	
}
int main()
{
//	freopen("dry.in","r",stdin);
//	freopen("dry.out","w",stdout);
cin >> n >> a >> b;	
 for(int i = 1; i <= n; i++)
 {
 scanf("%d", &p[i]);
 }
 sort(p+1, p+1+n, cmp);
 while(p[1] > 0)
 { 
 t++;
 p[1] = p[1] - a - b;
 for(int i = 2; i <= n; i++)
 {
 if(p[i] > 0)
 p[i] -= a;	
 }
 sort(p+1, p+1+n, cmp);

 }
 cout << t;
}