Farmer John is building a brand-new -story barn with the help of his cows. To complete the construction as quickly as possible, he needs your help to determine how to allocate the work among the cows.
Each cow must be assigned to exactly one of the floors, and every floor must have at least one cow assigned to it. The -th floor requires a_i units of work. Since each cow completes one unit of work per hour, if cows work on floor , then that floor will be completed in a_i / c units of time.
For safety reasons, construction on floor i + 1 cannot begin until floor has been completed.
Determine the minimum total time required to complete the barn if the cows are allocated to the floors optimally. Print the answer rounded to the nearest integer. It is guaranteed that the exact answer is more than away from any integer.
The first line contains two integers n~(1 \le n \le 10^5) and k~(n \le k \le 10^{12}).
The next lines contain the values a_1, \ldots, a_n, where each a_i is a positive integer not exceeding 10^{12}.
Print the minimum time required to complete the barn, rounded to the nearest integer.
Example 1