Farmer John is building a brand new, n-story barn, with the help of his k cows. To build it as quickly as possible, he needs your help to figure out how to allocate work among the cows.

Each cow must be assigned to work on exactly one specific floor out of the n total floors in the barn, and each floor must have at least one cow assigned to it. The ith floor requires ai units of total work, and each cow completes one unit of work per hour, so if c cows work on floor i, it will be completed in ai / c units of time. For safety reasons, floor i must be completed before construction can begin on floor i + 1.

Please compute the minimum total time in which the barn can be completed, if the cows are allocated to work on floors in an optimal fashion. Output this number rounded to the nearest integer; it is guaranteed that the solution will be more than 0.1 from the boundary between two integers.

Input

The first line contains n (1 ≤ n ≤ 105) and k (n ≤ k ≤ 1012). The next n lines contain a1 .. an, each a positive integer of size at most 1012.

Output

Print the minimum time required to build the barn, rounded to the nearest integer.