Output Format

Output a single positive integer: under the optimal storage plan, the total time required to access these $n$ files individually (the result is less than $2^{31}$).

4 3
3
5
4

28

Hint

Constraints

$1 \le n \le 1000$, $2 \le k \le 150$, $1 \le P_i \le 150$.

Translated by ChatGPT 5