You are given two $0$ indexed integer arrays, tasks and shifts.

The array tasks represents a sequence of tasks that must be processed in order, where tasks[i] is the amount of time required to complete the $i$th task. The array shifts represents consecutive work shifts, where shifts[i] is the time available during the $i$th shift.

Tasks are completed sequentially starting from task $0$:

• During a shift, time is spent on tasks in order. A task can be partially completed and will keep its progress for following shifts.

• If all tasks are completed within a shift, any remaining time in that shift is discarded, and all tasks reset so that processing restarts from task $0$ at the start of the next shift.

• If all tasks are not completed, work continues in the next shift from the point where it stopped.

Return an integer array ans where ans[i] is the number of unfinished tasks at the end of the $i$th shift.

Constraints:

• $1 \leq$ tasks.length $\leq 10^5$

• $1 \leq$ shifts.length $\leq 10^5$

• $1 \leq$ tasks[i] $\leq 10^9$

• $1 \leq$ shifts[i] $\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.