You are given an array of strings nums, where each string consists of digits and all strings have the same length. You are also given a $2$D integer array queries, where queries[i] = [ k_i , trim_i ].

For each query:

1. Trim each number in nums to its rightmost trim_i digits.

2. Find the original index of the $k_i^{ ext{th}}$ smallest trimmed number. If two trimmed values are equal, the element with the smaller index in nums is considered smaller.

3. Reset each number in nums to its initial length before processing the next query.

Return an array of integers representing the answers to each query in order.

Note: Trimmed numbers with leading zeros are still evaluated based on their numerical value. Since all trimmed strings for a query have the exact same length of trim_i digits, their numerical comparison is identical to their lexicographical comparison.

Constraints:

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

• $1 \leq$ nums[i].length $\leq 100$

• nums[i] consists of only digits.

• All nums[i].length are equal.

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

• queries[i].length $= 2$

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

• $1 \leq$ trim_i $\leq$ nums[i].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.