You are given an integer array nums and an array queries, where queries[i] = [l_i, r_i, val_i].

For each query queries[i], you can choose any subset of indices within the range $[l_i, r_i]$ and decrease the value at each selected index by $val_i$.

An array is considered a Zero Array if every element in the array is equal to $0$.

Return the minimum integer $k$ ($0 \leq k \leq$ queries.length) such that after applying the first $k$ queries, nums can be transformed into a Zero Array. If it is impossible to transform nums into a Zero Array even after applying all queries, return $-1$.

Constraints:

• $1 \leq$ nums.length $\leq 10$

• $0 \leq$ nums[i] $\leq 1000$

• $1 \leq$ queries.length $\leq 1000$

• queries[i] $= [l_i, r_i, val_i]$

• $0 \leq l_i \leq r_i <$ nums.length

• $1 \leq val_i \leq 10$

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.