You are given a strictly increasing integer array nums and a $2 ext{D}$ integer array queries, where queries[i] = [l_i, r_i, k_i].

For each query, all positive even integers appearing in the subarray nums[l_i \dots r_i] are removed from the set of all positive even integers ($2, 4, 6, 8, \dots$).

Return an array of integers ans where ans[i] represents the $k_i^{ ext{th}}$ smallest remaining positive even integer for the $i^{ ext{th}}$ query.

Constraints:

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

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

• nums is strictly increasing

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

• queries[i] = [l_i, r_i, k_i]

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

• $1 \leq$ k_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.