Passage of the Corridor#1899
In Petryk's game, there is a corridor divided into sections. Each section is covered by a certain number of unit tiles. The player controls a character that starts at the beginning of the corridor, just before the first section, and may proceed through it by performing one move.
If there is at least one tile on the section, passing through it removes one tile. If there are no tiles on the section, the character dies, the player loses one life, new tiles are added to that section, and a new character appears at the start of the corridor.
If the player successfully passes a section without dying, they move to the next section. In every case, one move is required. Only forward movement is allowed.
The corridor is considered successfully passed if at some moment the character ends up at the end of the corridor (i.e., passes through the last section and does not die there).
Your task is to determine how many lives the player will lose, and how many moves will be made, before the character reaches the end of the corridor.
The first line contains two integers and (1 \leq N \leq 10000, 1 \leq K \leq 100), the length of the corridor and the number of tiles that appear on a section after a character's death.
The second line contains integers, each representing the initial number of tiles covering the corresponding section. These numbers may take values from to inclusive.
Output the number of lives the player will lose and the number of moves made before the character reaches the end of the corridor.
Example 1