2343. Query Kth Smallest Trimmed Number

You are given a 0-indexed array of strings nums, where each string is of equal length and consists of only digits. You are also given a 0-indexed 2D integer array queries where queries[i] = [ki, trimi]. For each queries[i], you need to: - Trim each number in nums to its rightmost trimi digits. - Determine the index of the kith smallest trimmed number in nums. If two trimmed numbers are equal, t