import Control.Monad
import Control.Applicative
import Data.List

main = do
	n <- readLn
	[a, b] <- map (read :: String -> Int) . words <$> getLine
	l <- replicateM (n + 1) $ readLn
	print $ solve a b l

solvew :: Int -> Int -> [(Int, Int)] -> (Int, Int)
solvew a b [] = (a, b)
solvew a b ((x, y):z) = 
	let
		q = solvew a b z
		i = fst q
		j = snd q
		solveww c d e f
			| e * d <= c * f = (c, d)
			| otherwise = (c + e, d + f)
	in
		solveww i j x y

solve :: Int -> Int -> [Int] -> Int
solve a b (c:l) = 
	let
		q = solvew c a $ sort $ map (\x -> (x, b)) l
		x = fst q
		y = snd q
	in
		x `div` y