You are given an integer array nums, an integer array queries, and an integer x.

For each query queries[i], find the index of the queries[i]th occurrence of x in nums. If x occurs fewer than queries[i] times in nums, the answer for that query is $-1$.

Return an array containing the results for all queries in the given order.

Constraints:

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

• $1 \leq$ queries[i] $\leq 10^5$

• $1 \leq$ nums[i], x $\leq 10^4$

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.