You are given an array, nums, consisting of positive integers of size n and another array queries of size m. For each query i in queries, the goal is to make all elements of nums equal to queries[i]. To achieve this, you can perform the following operation any number of times:
Return an array answer of size m, where answer[i] is the minimum number of operations needed to make all elements of nums equal to queries[i]. After processing each query, the nums array is reset to its original state.
Constraints