#include<iostream>
#include<cstdio>
#include<cstring>
#include<queue>
using namespace std;
priority_queue<int>q;
inline int read()
{int f=0;char ch=getchar();while(ch>'9' || ch<'0')ch=getchar();while(ch>='0' && ch<='9'){f=f*10+ch-'0';ch=getchar();}return f;
}
int n,a,b;
int main()
{freopen("Dry.in","r",stdin);freopen("Dry.out","w",stdout);n=read();a=read();b=read();for(int i=1;i<=n;i++){int x=read();q.push(x);}int i;for(i=0;;++i){int x=q.top();q.pop();if(x-a*i<=0) break;else if(x-b>0)q.push(x-b);}printf("%d",i);return 0;
}

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
inline int read()
{int f=0;char ch=getchar();while(ch>'9' || ch<'0')ch=getchar();while(ch>='0' && ch<='9'){f=f*10+ch-'0';ch=getchar();}return f;
}
int n,a,b;
int cnt[500010];
int main()
{int mx=-1;n=read();a=read();b=read();for(int i=1;i<=n;i++){int x=read();cnt[x]++;mx=max(mx,x);}int t=0;while(t*a<mx){t++;if(mx-b>0)cnt[mx-b]++;cnt[mx]--;while(!cnt[mx])mx--;}printf("%d",t);return 0;
}

#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
using namespace std;
const int mod=26;
string s[1005];
double x[30];
double oc[30],sum1;
//oc记录字符串中字母出现次数
int tot;
struct rex{double p;
}p[26];
struct rec{string s;int len;int bo[10000];//小写0 大写1 符号2
}qaq[1005];
double sq()
{double w=0;for(int i=0;i<26;i++)w+=(p[i].p-x[i])*(p[i].p-x[i]);return w;
}
int main()
{//freopen("decode.in","r",stdin);//freopen("decode.out","w",stdout);for(int i=0;i<26;i++){scanf("%lf\n",&p[i].p);　　　　 //(-w-|||)  不//(-u-|||)  写//(-A-|||)  换//(-a-|||)  行//(-o-|||)  好//(-^-|||)  凉//(-v-|||)  爽
    }while(getline(cin,s[++tot])){qaq[tot].s=s[tot];int len=qaq[tot].len=s[tot].length();for(int i=0;i<len;i++){if(s[tot][i]>='a' && s[tot][i]<='z'){oc[s[tot][i]-'a']++;qaq[tot].bo[i]=0;}else if(s[tot][i]>='A'&&s[tot][i]<='Z'){oc[s[tot][i]-'A']++;qaq[tot].bo[i]=1;}else qaq[tot].bo[i]=2;}    }for(int i=0;i<26;i++)sum1+=oc[i];int ak=0;double sq1=999999999999;for(int k=0;k<26;k++){for(int i=0;i<26;i++)x[i]=oc[(i+k)%26]/sum1;if(sq1>sq()){sq1=sq();ak=k;}}for(int i=1;i<tot;i++){int len=qaq[i].len;for(int j=0;j<len;j++){char ch=qaq[i].s[j];if(qaq[i].bo[j]==2) cout<<ch;else if(qaq[i].bo[j]==0){cout<<(char)((ch-'a'-ak+52)%26+'a');}else if(qaq[i].bo[j]==1){cout<<(char)((ch-'A'-ak+52)%26+'A');}}cout<<endl;}return 0;
}

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int h[1000010],r[1000010],n,now;
long long ans=0;
inline int read()
{int f=0;char ch=getchar();while(ch>'9' || ch<'0')ch=getchar();while(ch>='0' && ch<='9'){f=f*10+ch-'0';ch=getchar();}return f;
}
void msort(int ll,int rr)
{if(ll==rr)return ;int mid=(ll+rr)>>1;msort(ll,mid);msort(mid+1,rr);//递归 int i=ll,j=mid+1,k=ll;while(i<=mid && j<=rr){if(h[i]<=h[j])r[k++]=h[i++];//先赋值再+1else {r[k++]=h[j++];ans+=(long long)mid-i+1;//重点
        }}while(i<=mid){r[k++]=h[i++];}while(j<=rr) {r[k++]=h[j++];}for(int i=ll;i<=rr;i++)h[i]=r[i];
}
int main()
{n=read();h[n+1]=0x3f3f3f3f;for(int i=1;i<=n;i++)h[i]=read();//区间翻转 for(int i=1;i<=n;i++){if(h[i]<h[i+1]){sort(h+now+1,h+i+1);now=i;ans++;}}//归并排序求逆序对msort(1,n);printf("%lld",ans);return 0;
}