Train

It is ski season! The train station is crowded with holidaymakers heading to the slopes. Afraid of missing their train, the passengers boarded the cars without checking where the free seats were.

Each car of the train has $K$ seats. The total number of seats equals the number of passengers exactly. That is always the case at this time of year.

Given how many passengers boarded each car, find the minimum total number of cars that passengers must pass through so that every passenger can sit down.

The first line contains two integers $N$, the number of cars, and $K$, the number of seats in each car. The second line contains $N$ integers $a_i$, where $a_i$ is the number of passengers who boarded car $i$.

It is given that $a_1 + \cdots + a_N = N \times K$.

Print one integer, the minimum total number of cars the passengers must pass through so that everyone can sit down.

The answer may exceed the range of a 32-bit integer. Use a 64-bit integer type to store it (long long in C/C++, Int64 in Pascal).

$1 \le N \le 1000000$ $1 \le K \le 1000000$