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:

• Increase or decrease an element of nums by 1.

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

• n $==$ nums.length

• m $==$ queries.length

• $1 \leq$ n, m $\leq 10^3$

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

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.