You are given an integer array nums, an integer k, and an integer multiplier.

You need to perform $k$ operations on nums. In each operation:

• Find the minimum value in nums. If there are multiple occurrences of the minimum value, choose the one with the smallest index.

• Replace the chosen value with its product with multiplier.

Return an array of integers representing the final state of nums after performing all $k$ operations. Since the values can be large, return each element modulo $10^9 + 7$.

Constraints:

• $1 \leq$ nums.length $\leq 10^4$

• $1 \leq$ nums[i] $\leq 10^9$

• $1 \leq$ k $\leq 10^9$

• $1 \leq$ multiplier $\leq 10^6$

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.