There are $n$ students numbered from $0$ to $n - 1$ sitting in a classroom, and an integer array chalk of length $n$, where chalk[i] represents the number of pieces of chalk that student i consumes to solve a single problem. You are also given an integer k, representing the initial amount of chalk pieces.

The students take turns answering questions in order starting from student $0$ up to student $n - 1$. Once student $n - 1$ completes their turn, the process restarts from student $0$ and continues in this cyclic order.

During their turn, if the number of remaining chalk pieces is strictly less than chalk[i], student i must replace the chalk.

Return the index of the student who will replace the chalk.

Constraints:

• chalk.length $== n$

• $1 \leq n \leq 10^5$

• $1 \leq$ chalk[i] $\leq 10^5$

• $1 \leq k \leq 10^9$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.