#include <bits/stdc++.h>

using namespace std;

using ll = long long;

const long long MOD = 1e9+7;

#define ALL(A) A.begin(),A.end()

void ALLIN1_NUMBER(vector<ll>& V)
{
    for(auto& x : V)
    {
        cin >> x;
    }
}

void ALLOUT_NUMBER(vector<ll> V)
{
    ll N = V.size();
    for(ll i=0;i<N;i++)
    {
        cout << V[i];
        if(i<N-1) cout << ' ';
    }
    cout << endl;
}


class Mll
{
    public:
    ll x;

    Mll() : x(0){}
    Mll(ll x=0) : x((x%MOD+MOD)%MOD){}

    Mll operator-() const
    {
        return Mll(-x);
    }

    Mll& operator+=(const Mll& A)
    {
        if((x += A.x) >= MOD) x -= MOD;
        return *this;
    }
    Mll& operator-=(const Mll& A)
    {
        if((x += MOD - A.x) >= MOD) x -= MOD;
        return *this;
    }
    Mll& operator*=(const Mll& A)
    {
        (x *= A.x) %= MOD;
        return *this;
    }
    
    Mll operator+(const Mll& A)
    {
        Mll res(*this);
        return res+=A;
    }
    Mll operator-(const Mll& A)
    {
        Mll res(*this);
        return res-=A;
    }
    Mll operator*(const Mll& A)
    {
        Mll res(*this);
        return res*=A;
    }
    
    Mll pow(ll t) const // t乗
    {
        if(t==0) return 1;
        Mll A = pow(t>>1);
        A *= A;
        if(t&1) A *= *this;
        return A;
    }

    // for prime mod
    Mll inv() const
    {
        return pow(MOD-2);
    }
    Mll& operator/=(const Mll& A)
    {
        return (*this) *= A.inv();
    }
    Mll operator/(const Mll& A) const
    {
        Mll res(*this);
        return res/=A;
    }

    friend ostream& operator<<(ostream& os, const Mll& M)
    {
        os << M.x;
        return os;
    }
};

vector<Mll> ALLIN_MLL(ll N)
{
    vector<ll> numbers_ll(N);
    ALLIN1_NUMBER(numbers_ll);

    vector<Mll> numbers_Mll;
    for(ll i=0;i<N;i++)
    {
        Mll add(numbers_ll[i]);
        numbers_Mll.push_back(add);
    }

    return numbers_Mll;
}

ll ceil(ll dividend, ll divisor)
{
    return (dividend + divisor - 1) / divisor;
}

class UnionFind
{
    public:
    vector<ll> par;

    UnionFind(ll n) : par(n,-1){}

    ll root(ll x)
    {
        if(par[x] < 0) return x;
        else return par[x] = root(par[x]);
    }

    bool same(ll x, ll y)
    {
        return root(x) == root(y);
    }

    void unite(ll x, ll y)
    {
        x = root(x); y = root(y);
        if(x==y) return;
        if(par[x] > par[y]) swap(x,y);
        par[x] += par[y];
        par[y] = x;
    }

    ll size(ll i)
    {
        return -par[root(i)];
    }
};


static const double pi = acos(-1.0);

double Cos(double D)
{
    return cos(pi/180 * D);
}

// まず初めに-1回とN回が渡される
// (l+r)/2 回で倒せるか
// 倒せたらそれをrとして再帰
// else それをlとして再帰
// ただしl+1==rのときはreturn r;
ll Binary_search_exp(ll l, ll r, const vector<ll>& V, const ll& diff, const ll& B)
{
    // l+1==r のときreturn r;
    if(l+1==r)
    {
        return r;
    }

    // (l+r)/2 回で倒せるかの判定
    auto x = [l,r,V,diff,B]()
    {
        ll counter = 0;
        for(ll i=0;V[i]>B*((l+r)/2);i++)
        {
            counter += ceil(V[i]-B*((l+r)/2),diff);
        }
        return counter <= (l+r)/2;
    };
    bool TF = x();

    // 倒せたらlと(l+r)/2で再帰
    if(TF)
    {
        return Binary_search_exp(l,(l+r)/2,V,diff,B);
    }

    // 倒せなければ(l+r)/2とrで再帰
    else
    {
        return Binary_search_exp((l+r)/2,r,V,diff,B);
    }
}



int main()
{
    ll N,A,B;
    cin >> N >> A >> B;

    vector<ll> V(N);
    ALLIN1_NUMBER(V);
    sort(ALL(V),greater<ll>());

    cout << Binary_search_exp(-1,ceil(V[0],B),V,A-B,B) << endl;

    return 0;
}

Measured memory_bytes: 27400