You are given two $0$ indexed integer arrays servers and tasks of lengths n and m respectively. The value servers[i] represents the weight of the $i^{th}$ server, and tasks[j] represents the time required to process the $j^{ th}$ task.

Tasks are assigned according to the following rules:

At second j, the $j^{th}$ task arrives and is placed into a queue, starting from task $0$ at second $0$ through task $m - 1$ at second $m - 1$.

While there are tasks in the queue and available servers, the task at the front of the queue is assigned to an available server that has the smallest weight. In the event of a tie, the server with the smallest index is chosen.

If no servers are available, the task remains in the queue until a server finishes its current task.

If multiple tasks are waiting in the queue when servers become available, they are processed in order of their arrival.

A server assigned task j at time t becomes free again at time $t +$ tasks[j].

Return an array ans of length m, where ans[j] is the index of the server assigned to process the $j^{ th}$ task.

Constraints:

• servers.length $= n$

• tasks.length $= m$

• $1 \leq n, m \leq 2 \times 10^5$

• $1 \leq$ servers[i], tasks[j] $\leq 2 \times 10^5$

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.