using System;
using System.Linq;
using System.Collections.Generic;

namespace Contest
{
    class Program
    {
        static void Main(string[] args)
        {
            ARC075.D();
        }
        class ARC075
        {
            public static void C()
            {
                var N = Read.Int();
                var S = Enumerable.Range(0, N).Select(i => Read.Int()).ToArray();
                var total = S.Sum();
                if (total % 10 > 0) { Console.WriteLine(total); return; }
                var min = 999;
                foreach(var s in S)
                {
                    if(s%10>0 && min > s) { min = s; }
                }
                Console.WriteLine(min == 999 ? 0 : total - min);
            }
            public static void D()
            {
                var N = Read.Int();
                var A = Read.Long();
                var B = Read.Long();
                var H = Enumerable.Range(0, N).Select(i => Read.Long()).ToArray();

                Func<long, bool> Win = K =>
                {
                    long need = 0;
                    foreach(var h in H)
                    {
                        if(h > K * B)
                        {
                            need += (h - K * B + A - B - 1) / (A - B);
                        }
                    }
                    return K >= need;
                };

                long min = 0;
                long max = (long)1e9;
                while (min + 1 < max)
                {
                    var mid = (min + max) / 2;
                    if (Win(mid))
                    {
                        max = mid;
                    }
                    else
                    {
                        min = mid;
                    }
                }
                Console.WriteLine(max);
            }
            public static void E()
            {
                var N = Read.Int();
                var K = Read.Long();
                var A = Enumerable.Range(0, N).Select(i => Read.Long()).ToArray();
                var comp = Util.Compress(Util.ASum(A).Select((x, i) => x - i * K).ToArray());
                var bit = new Util.BIT(N + 1);
                long ans = 0;
                for (int i = 0; i <= N; ++i)
                {
                    ans += bit.Sum(comp[i]);
                    bit.Add(comp[i], 1);
                }
                Console.WriteLine(ans);
            }
        }
        class Util
        {
            public static int[] Compress(long[] array, bool needDistinct = true)
            {
                var sorted = needDistinct ? array.Distinct().ToArray() : array.ToArray(); Array.Sort(sorted);
                Dictionary<long, int> dict = new Dictionary<long, int>(); for (int i = 0; i < sorted.Length; ++i) { dict.Add(sorted[i], i + 1); }
                return array.Select(x => dict[x]).ToArray();
            }
            public static long[] ASum(long[] array)
            {
                var res = new long[array.Length + 1];
                for (int i = 0; i < array.Length; ++i)
                {
                    res[i + 1] = res[i] + array[i];
                }
                return res;
            }
            public class BIT
            {
                int N; long[] array;
                public BIT(int m) { for (int n = 1; ; n *= 2) { if (n >= m) { N = n; array = new long[N + 1]; break; } } }
                public void Add(int idx, int v) { for (int x = idx; x <= N; x += x & -x) { array[x] += v; } }
                public long Sum(int idx) { long ret = 0; for (int x = idx; x > 0; x -= x & -x) { ret += array[x]; } return ret; }
            }
        }

        static class Read
        {
            static Queue<string> queue = new Queue<string>();
            static void Enqueue() { var ss = Console.ReadLine().Split(' '); foreach (var s in ss) { queue.Enqueue(s); } }
            public static int Int() { if (queue.Count == 0) { Enqueue(); } return Convert.ToInt32(queue.Dequeue()); }
            public static long Long() { if (queue.Count == 0) { Enqueue(); } return Convert.ToInt64(queue.Dequeue()); }
            public static string Str() { if (queue.Count == 0) { Enqueue(); } return queue.Dequeue(); }
            public static int[] IntN() { return Console.ReadLine().Split(' ').Select(s => Convert.ToInt32(s)).ToArray(); }
            public static long[] LongN() { return Console.ReadLine().Split(' ').Select(s => Convert.ToInt64(s)).ToArray(); }
            public static ulong[] ULongN() { return Console.ReadLine().Split(' ').Select(s => Convert.ToUInt64(s)).ToArray(); }
            public static string[] StrN() { return Console.ReadLine().Split(' '); }
            public static Tuple<int, int>[] TupleInt(int n) { List<Tuple<int, int>> list = new List<Tuple<int, int>>(); for (int i = 0; i < n; ++i) { var ab = Read.IntN(); list.Add(new Tuple<int, int>(ab[0], ab[1])); } return list.ToArray(); }
            public static Tuple<long, long>[] TupleLong(int n) { List<Tuple<long, long>> list = new List<Tuple<long, long>>(); for (int i = 0; i < n; ++i) { var ab = Read.LongN(); list.Add(new Tuple<long, long>(ab[0], ab[1])); } return list.ToArray(); }
            public static Tuple<string, string>[] TupleStr(int n) { List<Tuple<string, string>> list = new List<Tuple<string, string>>(); for (int i = 0; i < n; ++i) { var ab = Read.StrN(); list.Add(new Tuple<string, string>(ab[0], ab[1])); } return list.ToArray(); }
            public static Tuple<double, double>[] TupleDouble(int n) { List<Tuple<double, double>> list = new List<Tuple<double, double>>(); for (int i = 0; i < n; ++i) { var ab = Read.LongN(); list.Add(new Tuple<double, double>(ab[0], ab[1])); } return list.ToArray(); }
            public static long[,] LongMatrix(int r, int c)
            {
                var mat = new long[r, c];
                for (int i = 0; i < r; ++i)
                {
                    var x = Read.LongN();
                    for (int j = 0; j < c; ++j)
                    {
                        mat[i, j] = x[j];
                    }
                }
                return mat;
            }
            public static Dictionary<int, HashSet<int>> AdjacencyList(int N, int M, bool isDirectional = false)
            {
                Dictionary<int, HashSet<int>> dict = new Dictionary<int, HashSet<int>>();
                for (int i = 0; i <= N; ++i) { dict.Add(i, new HashSet<int>()); }
                for (int i = 0; i < M; ++i)
                {
                    var ab = Read.IntN(); dict[ab[0]].Add(ab[1]);
                    if (!isDirectional) { dict[ab[1]].Add(ab[0]); }
                }
                return dict;
            }
            public static Dictionary<int, Dictionary<int, long>> AdjacencyListWithWeight(int N, int M)
            {
                Dictionary<int, Dictionary<int, long>> dict = new Dictionary<int, Dictionary<int, long>>();
                for (int i = 0; i <= N; ++i)
                {
                    dict.Add(i, new Dictionary<int, long>());
                }
                for (int i = 0; i < M; ++i)
                {
                    var ab = Read.IntN();
                    dict[ab[0]].Add(ab[1], ab[2]);
                    dict[ab[1]].Add(ab[0], ab[2]);
                }
                return dict;
            }
        }
    }
}


Measured memory_bytes: 18000