You are given a $0$ indexed integer array nums that undergoes a continuous transformation process.

Initially, at minute $0$, the array is nums.

• During the first nums.length minutes, the leftmost element is removed from the array at each minute until the array becomes empty.

• During the subsequent nums.length minutes, elements from the original nums are appended back to the array one by one in their original order until the array is fully restored.

• This cycle repeats indefinitely, alternating between removing all elements from left to right and appending all original elements from left to right.

You are also given a $2 ext{D}$ integer array queries, where queries[j] = [time_j, index_j]. For the $j^{ ext{th}}$ query, determine the element located at index index_j of the array at minute time_j. If the index is out of bounds or the array does not contain an element at index_j at that minute, the answer is $-1$.

Return an array of integers representing the answers to all queries in the given order.

Constraints:

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

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

• n $==$ queries.length

• $1 \leq$ n $\leq 10^5$

• queries[j].length $== 2$

• $0 \leq$ time_j $\leq 10^5$

• $0 \leq$ index_j $<$ nums.length

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.