You are given two $1$ indexed integer arrays, nums of length n and changeIndices of length m.

Initially, all indices in nums are unmarked.

At each second s from $1$ to m, you can perform one of the following operations:

• Choose an index i such that $1 \le$ i $\le$ n, and decrement nums[i] by $1$.

• Set nums[changeIndices[s]] to $0$.

• Choose an index i such that $1 \le$ i $\le$ n and nums[i] is equal to $0$, and mark index i.

• Do nothing.

Return an integer representing the earliest second in the range $[1, m]$ at which all indices in nums can be marked, or $-1$ if it is impossible to mark all indices.

Constraints:

• $1 \le$ n $==$ nums.length $\le 5000$

• $0 \le$ nums[i] $\le 10^9$

• $1 \le$ m $==$ changeIndices.length $\le 5000$

• $1 \le$ changeIndices[i] $\le$ n

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.