\includegraphics{https://static.e-olymp.com/content/b2/b2a36b51ee765e8dae0acd79f38795e8d6f59ca4.jpg} The trick to boiling vegetables is to make sure all pieces are about the same size. If they are not, the small ones get too soft or the large ones get undercooked (or both). Fortunately, you have heard of the kitchen knife, but your parents' warnings of using sharp instruments still echoes in your head. Therefore you better use it as little as possible. You can take a piece of a vegetable of weight $w$ and cut it arbitrarily in two pieces of weight $w_{left}$ and $w_{right}$, where $w_{left} + w_{right} = w$. This operation constitutes a "\textbf{cut}". Given a set of pieces of vegetables, determine the minimum number of cuts needed to make the ratio between the smallest and the largest resulting piece go above a given threshold. \InputFile Starts with a floating point number $t~(0.5 < t < 1)$ with $2$ decimal digits, and a positive integer $n~(n \le 1000)$. Next follow $n$ positive integer weights $w_1, w_2, ..., w_n$. All weights are less than $10^6$. \OutputFile Output the minimum number of cuts needed to make the ratio between the resulting minimum weight piece and the resulting maximum weight piece be above $t$. You may assume that the number of cuts needed is less than $500$. To avoid issues with floating point numbers, you can assume that the optimal answer for ratio $t$ is the same as for ratio $t + 0.0001$.